./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array25_pattern.c --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-patterns/array25_pattern.c -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 d5acc4e7957d3ad66d9b011b6d1c27cdde7a453adaa0d9781357dfd70a9cc20a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:23:56,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:23:56,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:23:56,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:23:56,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:23:56,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:23:56,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:23:56,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:23:56,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:23:56,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:23:56,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:23:56,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:23:56,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:23:56,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:23:56,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:23:56,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:23:56,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:23:56,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:23:56,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:23:56,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:23:56,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:23:56,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:23:56,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:23:56,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:23:56,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:23:56,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:23:56,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:23:56,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:23:56,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:23:56,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:23:56,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:23:56,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:23:56,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:23:56,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:23:56,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:23:56,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:23:56,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:23:56,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:23:56,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:23:56,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:23:56,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:23:56,575 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:23:56,600 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:23:56,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:23:56,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:23:56,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:23:56,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:23:56,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:23:56,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:23:56,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:23:56,603 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:23:56,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:23:56,604 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:23:56,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:23:56,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:23:56,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:23:56,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:23:56,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:23:56,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:23:56,605 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:23:56,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:23:56,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:23:56,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:23:56,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:23:56,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:23:56,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:23:56,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:23:56,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:23:56,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:23:56,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:23:56,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:23:56,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:23:56,607 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:23:56,607 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:23:56,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:23:56,607 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 -> d5acc4e7957d3ad66d9b011b6d1c27cdde7a453adaa0d9781357dfd70a9cc20a [2022-02-20 14:23:56,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:23:56,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:23:56,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:23:56,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:23:56,831 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:23:56,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array25_pattern.c [2022-02-20 14:23:56,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cab1a05/a0eb8af8ebf94c15bc5bf06341c1346b/FLAG4a7bd9a66 [2022-02-20 14:23:57,287 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:23:57,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array25_pattern.c [2022-02-20 14:23:57,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cab1a05/a0eb8af8ebf94c15bc5bf06341c1346b/FLAG4a7bd9a66 [2022-02-20 14:23:57,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cab1a05/a0eb8af8ebf94c15bc5bf06341c1346b [2022-02-20 14:23:57,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:23:57,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:23:57,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:23:57,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:23:57,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:23:57,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:23:57" (1/1) ... [2022-02-20 14:23:57,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a4ea73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57, skipping insertion in model container [2022-02-20 14:23:57,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:23:57" (1/1) ... [2022-02-20 14:23:57,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:23:57,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:23:57,484 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-patterns/array25_pattern.c[1270,1283] [2022-02-20 14:23:57,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:23:57,524 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:23:57,536 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-patterns/array25_pattern.c[1270,1283] [2022-02-20 14:23:57,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:23:57,562 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:23:57,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57 WrapperNode [2022-02-20 14:23:57,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:23:57,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:23:57,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:23:57,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:23:57,569 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:23:57" (1/1) ... [2022-02-20 14:23:57,579 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:23:57" (1/1) ... [2022-02-20 14:23:57,605 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2022-02-20 14:23:57,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:23:57,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:23:57,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:23:57,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:23:57,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57" (1/1) ... [2022-02-20 14:23:57,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57" (1/1) ... [2022-02-20 14:23:57,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57" (1/1) ... [2022-02-20 14:23:57,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57" (1/1) ... [2022-02-20 14:23:57,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57" (1/1) ... [2022-02-20 14:23:57,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57" (1/1) ... [2022-02-20 14:23:57,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57" (1/1) ... [2022-02-20 14:23:57,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:23:57,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:23:57,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:23:57,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:23:57,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57" (1/1) ... [2022-02-20 14:23:57,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:23:57,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:57,672 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:23:57,673 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:23:57,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:23:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:23:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:23:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:23:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:23:57,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:23:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:23:57,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:23:57,748 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:23:57,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:23:57,982 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:23:57,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:23:57,999 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:23:58,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:23:58 BoogieIcfgContainer [2022-02-20 14:23:58,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:23:58,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:23:58,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:23:58,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:23:58,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:23:57" (1/3) ... [2022-02-20 14:23:58,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee6ee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:23:58, skipping insertion in model container [2022-02-20 14:23:58,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:57" (2/3) ... [2022-02-20 14:23:58,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee6ee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:23:58, skipping insertion in model container [2022-02-20 14:23:58,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:23:58" (3/3) ... [2022-02-20 14:23:58,007 INFO L111 eAbstractionObserver]: Analyzing ICFG array25_pattern.c [2022-02-20 14:23:58,017 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:23:58,017 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:23:58,061 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:23:58,068 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:23:58,068 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:23:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:23:58,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:58,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:58,085 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash -320975489, now seen corresponding path program 1 times [2022-02-20 14:23:58,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:58,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286558101] [2022-02-20 14:23:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:58,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {26#true} is VALID [2022-02-20 14:23:58,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {26#true} is VALID [2022-02-20 14:23:58,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {27#false} is VALID [2022-02-20 14:23:58,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#false} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {27#false} is VALID [2022-02-20 14:23:58,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#false} assume !true; {27#false} is VALID [2022-02-20 14:23:58,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#false} main_~row~0#1 := 0; {27#false} is VALID [2022-02-20 14:23:58,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {27#false} is VALID [2022-02-20 14:23:58,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || main_~sum~0#1 == ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {27#false} is VALID [2022-02-20 14:23:58,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 == __VERIFIER_assert_~cond#1; {27#false} is VALID [2022-02-20 14:23:58,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 14:23:58,244 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:23:58,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:58,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286558101] [2022-02-20 14:23:58,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286558101] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:58,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:58,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:23:58,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214682787] [2022-02-20 14:23:58,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:58,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:23:58,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:58,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:58,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:23:58,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:58,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:23:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:23:58,302 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:58,348 INFO L93 Difference]: Finished difference Result 43 states and 64 transitions. [2022-02-20 14:23:58,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:23:58,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:23:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 14:23:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 14:23:58,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2022-02-20 14:23:58,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:58,435 INFO L225 Difference]: With dead ends: 43 [2022-02-20 14:23:58,435 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 14:23:58,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:23:58,440 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:58,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 14:23:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 14:23:58,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:58,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,464 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,464 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:58,467 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 14:23:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 14:23:58,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:58,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:58,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 14:23:58,469 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 14:23:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:58,471 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 14:23:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 14:23:58,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:58,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:58,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:58,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-02-20 14:23:58,478 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2022-02-20 14:23:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:58,478 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-20 14:23:58,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 14:23:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:23:58,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:58,479 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:58,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:23:58,480 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:58,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1931938343, now seen corresponding path program 1 times [2022-02-20 14:23:58,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:58,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737375601] [2022-02-20 14:23:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:58,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:58,508 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:58,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151197955] [2022-02-20 14:23:58,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:58,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:58,518 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:23:58,519 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:23:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:58,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:23:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:58,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:58,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {144#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {144#true} is VALID [2022-02-20 14:23:58,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {144#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {144#true} is VALID [2022-02-20 14:23:58,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#true} assume !(0 == assume_abort_if_not_~cond#1); {144#true} is VALID [2022-02-20 14:23:58,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {144#true} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:58,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:58,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_~row~0#1 := 0; {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:58,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:58,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || main_~sum~0#1 == ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {171#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:23:58,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {145#false} is VALID [2022-02-20 14:23:58,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {145#false} assume !false; {145#false} is VALID [2022-02-20 14:23:58,684 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:23:58,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:58,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:58,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737375601] [2022-02-20 14:23:58,685 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:58,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151197955] [2022-02-20 14:23:58,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151197955] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:58,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:58,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:23:58,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449629956] [2022-02-20 14:23:58,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:58,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:23:58,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:58,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:58,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:23:58,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:58,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:23:58,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:23:58,701 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:58,760 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 14:23:58,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:23:58,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:23:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 14:23:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 14:23:58,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-20 14:23:58,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:58,790 INFO L225 Difference]: With dead ends: 26 [2022-02-20 14:23:58,790 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 14:23:58,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:23:58,791 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:58,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 52 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 14:23:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 14:23:58,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:58,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,794 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,795 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:58,796 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-02-20 14:23:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 14:23:58,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:58,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:58,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 14:23:58,797 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 14:23:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:58,798 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-02-20 14:23:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 14:23:58,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:58,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:58,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:58,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-20 14:23:58,800 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2022-02-20 14:23:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:58,800 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-20 14:23:58,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 14:23:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:23:58,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:58,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:58,819 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:23:59,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:59,018 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:59,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash -94215630, now seen corresponding path program 1 times [2022-02-20 14:23:59,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:59,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674703876] [2022-02-20 14:23:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:59,030 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:59,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [225819569] [2022-02-20 14:23:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:59,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:59,048 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:23:59,058 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:23:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:59,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:23:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:59,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:59,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {283#true} is VALID [2022-02-20 14:23:59,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {283#true} is VALID [2022-02-20 14:23:59,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume !(0 == assume_abort_if_not_~cond#1); {283#true} is VALID [2022-02-20 14:23:59,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {283#true} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {297#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:23:59,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {297#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {301#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:59,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#(<= ~ARR_SIZE~0 0)} main_~row~0#1 := 0; {305#(and (<= ~ARR_SIZE~0 0) (<= 0 |ULTIMATE.start_main_~row~0#1|))} is VALID [2022-02-20 14:23:59,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(and (<= ~ARR_SIZE~0 0) (<= 0 |ULTIMATE.start_main_~row~0#1|))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {284#false} is VALID [2022-02-20 14:23:59,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {284#false} is VALID [2022-02-20 14:23:59,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {284#false} is VALID [2022-02-20 14:23:59,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {284#false} is VALID [2022-02-20 14:23:59,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {284#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {284#false} is VALID [2022-02-20 14:23:59,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {284#false} is VALID [2022-02-20 14:23:59,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {284#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || main_~sum~0#1 == ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {284#false} is VALID [2022-02-20 14:23:59,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#false} assume 0 == __VERIFIER_assert_~cond#1; {284#false} is VALID [2022-02-20 14:23:59,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-02-20 14:23:59,210 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:23:59,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:59,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:59,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674703876] [2022-02-20 14:23:59,211 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:59,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225819569] [2022-02-20 14:23:59,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225819569] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:59,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:59,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:23:59,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169673528] [2022-02-20 14:23:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:59,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:23:59,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:59,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:59,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:59,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:23:59,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:59,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:23:59,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:23:59,229 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:59,376 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-02-20 14:23:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:23:59,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:23:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 14:23:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 14:23:59,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2022-02-20 14:23:59,433 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:23:59,436 INFO L225 Difference]: With dead ends: 54 [2022-02-20 14:23:59,436 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:23:59,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:23:59,439 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:59,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 31 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:23:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2022-02-20 14:23:59,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:59,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:59,450 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:59,450 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:59,451 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 14:23:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 14:23:59,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:59,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:59,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 14:23:59,452 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 14:23:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:59,455 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 14:23:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 14:23:59,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:59,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:59,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:59,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-02-20 14:23:59,461 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 15 [2022-02-20 14:23:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:59,461 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-20 14:23:59,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-20 14:23:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:23:59,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:59,463 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:59,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 14:23:59,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 14:23:59,681 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash -169454663, now seen corresponding path program 1 times [2022-02-20 14:23:59,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:59,682 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114899551] [2022-02-20 14:23:59,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:59,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:59,699 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:59,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847513633] [2022-02-20 14:23:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:59,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:59,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:59,701 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:23:59,723 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:23:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:59,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:23:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:59,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:59,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {511#true} is VALID [2022-02-20 14:23:59,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {511#true} is VALID [2022-02-20 14:23:59,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {511#true} assume !(0 == assume_abort_if_not_~cond#1); {511#true} is VALID [2022-02-20 14:23:59,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {511#true} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {525#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:59,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {525#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {529#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:59,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {512#false} is VALID [2022-02-20 14:23:59,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {512#false} is VALID [2022-02-20 14:23:59,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {512#false} is VALID [2022-02-20 14:23:59,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#false} main_~row~0#1 := 0; {512#false} is VALID [2022-02-20 14:23:59,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {512#false} is VALID [2022-02-20 14:23:59,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {512#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {512#false} is VALID [2022-02-20 14:23:59,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {512#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {512#false} is VALID [2022-02-20 14:23:59,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {512#false} is VALID [2022-02-20 14:23:59,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {512#false} is VALID [2022-02-20 14:23:59,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {512#false} is VALID [2022-02-20 14:23:59,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {512#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || main_~sum~0#1 == ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {512#false} is VALID [2022-02-20 14:23:59,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#false} assume 0 == __VERIFIER_assert_~cond#1; {512#false} is VALID [2022-02-20 14:23:59,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {512#false} assume !false; {512#false} is VALID [2022-02-20 14:23:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:23:59,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:59,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:59,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114899551] [2022-02-20 14:23:59,890 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:59,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847513633] [2022-02-20 14:23:59,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847513633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:59,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:59,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:23:59,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369008960] [2022-02-20 14:23:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:59,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:23:59,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:59,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:23:59,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:59,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:23:59,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:59,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:23:59,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:23:59,903 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:00,028 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2022-02-20 14:24:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:24:00,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:24:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 14:24:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 14:24:00,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-02-20 14:24:00,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:00,087 INFO L225 Difference]: With dead ends: 54 [2022-02-20 14:24:00,088 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 14:24:00,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:00,089 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:00,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 16 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:24:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 14:24:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-02-20 14:24:00,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:00,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,105 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,105 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:00,106 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 14:24:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 14:24:00,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:00,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:00,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-20 14:24:00,107 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-20 14:24:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:00,110 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 14:24:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 14:24:00,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:00,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:00,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:00,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-02-20 14:24:00,112 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2022-02-20 14:24:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:00,112 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-02-20 14:24:00,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-20 14:24:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:24:00,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:00,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:00,137 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:24:00,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:00,328 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash -308201553, now seen corresponding path program 1 times [2022-02-20 14:24:00,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:00,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059230613] [2022-02-20 14:24:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:00,345 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:00,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669325867] [2022-02-20 14:24:00,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:00,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:00,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:00,347 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:24:00,355 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:24:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:00,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:24:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:00,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:00,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {753#true} is VALID [2022-02-20 14:24:00,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {761#(or (and (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 1 ~ARR_SIZE~0)))} is VALID [2022-02-20 14:24:00,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {761#(or (and (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 1 ~ARR_SIZE~0)))} assume !(0 == assume_abort_if_not_~cond#1); {765#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:00,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {765#(< 1 ~ARR_SIZE~0)} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {765#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:00,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {765#(< 1 ~ARR_SIZE~0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:00,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:00,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume 0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:00,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {782#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:24:00,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:00,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {754#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {754#false} is VALID [2022-02-20 14:24:00,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {754#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:00,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {754#false} main_~row~0#1 := 0; {754#false} is VALID [2022-02-20 14:24:00,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {754#false} is VALID [2022-02-20 14:24:00,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {754#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {754#false} is VALID [2022-02-20 14:24:00,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {754#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {754#false} is VALID [2022-02-20 14:24:00,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {754#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:00,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {754#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {754#false} is VALID [2022-02-20 14:24:00,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {754#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:00,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || main_~sum~0#1 == ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {754#false} is VALID [2022-02-20 14:24:00,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {754#false} assume 0 == __VERIFIER_assert_~cond#1; {754#false} is VALID [2022-02-20 14:24:00,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#false} assume !false; {754#false} is VALID [2022-02-20 14:24:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:24:00,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:00,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#false} assume !false; {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {754#false} assume 0 == __VERIFIER_assert_~cond#1; {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || main_~sum~0#1 == ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {754#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {754#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {754#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {754#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {754#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {754#false} main_~row~0#1 := 0; {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {754#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:00,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {754#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {754#false} is VALID [2022-02-20 14:24:00,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:00,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {858#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:00,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} assume 0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:00,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:00,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {765#(< 1 ~ARR_SIZE~0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:00,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {765#(< 1 ~ARR_SIZE~0)} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {765#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:00,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {878#(or (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} assume !(0 == assume_abort_if_not_~cond#1); {765#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:00,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {878#(or (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} is VALID [2022-02-20 14:24:00,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {753#true} is VALID [2022-02-20 14:24:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:24:00,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:00,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059230613] [2022-02-20 14:24:00,712 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:00,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669325867] [2022-02-20 14:24:00,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669325867] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:24:00,712 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:24:00,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-02-20 14:24:00,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687104607] [2022-02-20 14:24:00,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:24:00,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:24:00,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:00,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:00,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:24:00,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:00,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:24:00,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:24:00,742 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:01,123 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2022-02-20 14:24:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:24:01,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:24:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 14:24:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 14:24:01,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-02-20 14:24:01,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:01,183 INFO L225 Difference]: With dead ends: 65 [2022-02-20 14:24:01,183 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 14:24:01,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:24:01,184 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 94 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:01,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 27 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:24:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 14:24:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-02-20 14:24:01,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:01,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,213 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,213 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:01,214 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 14:24:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-20 14:24:01,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:01,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:01,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-20 14:24:01,215 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-20 14:24:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:01,217 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 14:24:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-20 14:24:01,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:01,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:01,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:01,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-02-20 14:24:01,218 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 21 [2022-02-20 14:24:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:01,219 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-02-20 14:24:01,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-20 14:24:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:24:01,220 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:01,220 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:01,239 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:24:01,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:01,433 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1610723178, now seen corresponding path program 1 times [2022-02-20 14:24:01,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:01,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066767303] [2022-02-20 14:24:01,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:01,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:01,462 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:01,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [169431778] [2022-02-20 14:24:01,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:01,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:01,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:01,464 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:24:01,467 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:24:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:01,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:24:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:01,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:01,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {1120#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1120#true} is VALID [2022-02-20 14:24:01,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {1120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1120#true} is VALID [2022-02-20 14:24:01,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {1120#true} assume !(0 == assume_abort_if_not_~cond#1); {1120#true} is VALID [2022-02-20 14:24:01,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {1120#true} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {1134#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:24:01,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {1134#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:01,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:01,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume 0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:01,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1148#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:01,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {1148#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:01,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2)); {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:01,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(1 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 1 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2));call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:01,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:01,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:01,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1168#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:24:01,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {1168#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:01,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {1121#false} main_~row~0#1 := 0; {1121#false} is VALID [2022-02-20 14:24:01,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {1121#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1121#false} is VALID [2022-02-20 14:24:01,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {1121#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1121#false} is VALID [2022-02-20 14:24:01,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {1121#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1121#false} is VALID [2022-02-20 14:24:01,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {1121#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1121#false} is VALID [2022-02-20 14:24:01,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {1121#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1121#false} is VALID [2022-02-20 14:24:01,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {1121#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:01,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {1121#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1121#false} is VALID [2022-02-20 14:24:01,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {1121#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:01,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {1121#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || main_~sum~0#1 == ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1121#false} is VALID [2022-02-20 14:24:01,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {1121#false} assume 0 == __VERIFIER_assert_~cond#1; {1121#false} is VALID [2022-02-20 14:24:01,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {1121#false} assume !false; {1121#false} is VALID [2022-02-20 14:24:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:24:01,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:01,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {1121#false} assume !false; {1121#false} is VALID [2022-02-20 14:24:01,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {1121#false} assume 0 == __VERIFIER_assert_~cond#1; {1121#false} is VALID [2022-02-20 14:24:01,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {1121#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || main_~sum~0#1 == ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1121#false} is VALID [2022-02-20 14:24:01,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {1121#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:01,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {1121#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1121#false} is VALID [2022-02-20 14:24:01,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {1121#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:01,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {1121#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1121#false} is VALID [2022-02-20 14:24:01,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {1121#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1121#false} is VALID [2022-02-20 14:24:01,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {1121#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1121#false} is VALID [2022-02-20 14:24:01,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {1121#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1121#false} is VALID [2022-02-20 14:24:01,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {1121#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1121#false} is VALID [2022-02-20 14:24:01,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {1121#false} main_~row~0#1 := 0; {1121#false} is VALID [2022-02-20 14:24:01,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {1244#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:01,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1244#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:01,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:01,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:01,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(1 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 1 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2));call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:01,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2)); {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:01,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:01,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1264#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:01,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} assume 0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:01,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:01,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {1134#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:01,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {1120#true} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {1134#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:24:01,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {1120#true} assume !(0 == assume_abort_if_not_~cond#1); {1120#true} is VALID [2022-02-20 14:24:01,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1120#true} is VALID [2022-02-20 14:24:01,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {1120#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1120#true} is VALID [2022-02-20 14:24:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:24:01,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:01,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066767303] [2022-02-20 14:24:01,928 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:01,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169431778] [2022-02-20 14:24:01,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169431778] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:24:01,928 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:24:01,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-02-20 14:24:01,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339337360] [2022-02-20 14:24:01,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:24:01,929 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:24:01,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:01,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:01,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:24:01,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:01,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:24:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:24:01,956 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:02,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:02,518 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2022-02-20 14:24:02,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 14:24:02,518 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:24:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 110 transitions. [2022-02-20 14:24:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 110 transitions. [2022-02-20 14:24:02,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 110 transitions. [2022-02-20 14:24:02,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:02,602 INFO L225 Difference]: With dead ends: 113 [2022-02-20 14:24:02,602 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 14:24:02,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-02-20 14:24:02,603 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 97 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:02,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 25 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:24:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 14:24:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2022-02-20 14:24:02,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:02,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:02,656 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:02,657 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:02,659 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2022-02-20 14:24:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2022-02-20 14:24:02,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:02,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:02,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 88 states. [2022-02-20 14:24:02,660 INFO L87 Difference]: Start difference. First operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 88 states. [2022-02-20 14:24:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:02,661 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2022-02-20 14:24:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2022-02-20 14:24:02,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:02,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:02,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:02,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 88 transitions. [2022-02-20 14:24:02,664 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 88 transitions. Word has length 27 [2022-02-20 14:24:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:02,664 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 88 transitions. [2022-02-20 14:24:02,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-02-20 14:24:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 14:24:02,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:02,665 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:02,684 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:24:02,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:02,885 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1943339208, now seen corresponding path program 1 times [2022-02-20 14:24:02,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:02,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685196757] [2022-02-20 14:24:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:02,907 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:02,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137984795] [2022-02-20 14:24:02,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:02,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:02,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:02,909 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:24:02,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 14:24:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:03,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 61 conjunts are in the unsatisfiable core [2022-02-20 14:24:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:03,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:03,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 60 [2022-02-20 14:24:03,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 14:24:03,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 14:24:03,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77 [2022-02-20 14:24:03,498 INFO L356 Elim1Store]: treesize reduction 180, result has 9.5 percent of original size [2022-02-20 14:24:03,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 144 [2022-02-20 14:24:04,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 91 [2022-02-20 14:24:04,116 INFO L356 Elim1Store]: treesize reduction 354, result has 8.8 percent of original size [2022-02-20 14:24:04,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 161 [2022-02-20 14:24:04,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 122 [2022-02-20 14:24:04,677 INFO L356 Elim1Store]: treesize reduction 522, result has 8.3 percent of original size [2022-02-20 14:24:04,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 271 treesize of output 323 [2022-02-20 14:24:04,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:04,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:04,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:04,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:04,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:04,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:04,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:04,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:04,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:04,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:04,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 65 [2022-02-20 14:24:05,966 INFO L356 Elim1Store]: treesize reduction 168, result has 0.6 percent of original size [2022-02-20 14:24:05,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 41 [2022-02-20 14:24:06,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {1729#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1729#true} is VALID [2022-02-20 14:24:06,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {1729#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1737#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:24:06,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#(<= ~ARR_SIZE~0 32767)} assume !(0 == assume_abort_if_not_~cond#1); {1737#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:24:06,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {1737#(<= ~ARR_SIZE~0 32767)} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {1744#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:06,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {1744#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1748#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:06,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {1748#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1748#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:06,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {1748#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume 0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~num~0#1 * main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1755#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:06,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {1755#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1759#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:06,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {1759#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1763#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:06,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {1763#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 32767))} assume !(0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2)); {1763#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:06,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {1763#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 32767))} assume !(1 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 1 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2));call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1770#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:06,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {1770#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1774#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~column~0#1| 2) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:06,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {1774#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~column~0#1| 2) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {1778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1782#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {1782#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} assume !(0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2)); {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} assume !(1 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 1 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2));call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1796#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (exists ((v_DerPreprocessor_3 Int)) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|) v_DerPreprocessor_3) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 0) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {1796#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (exists ((v_DerPreprocessor_3 Int)) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|) v_DerPreprocessor_3) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 0) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= ~ARR_SIZE~0 2) (exists ((v_DerPreprocessor_3 Int)) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 0) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))))} is VALID [2022-02-20 14:24:06,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= ~ARR_SIZE~0 2) (exists ((v_DerPreprocessor_3 Int)) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 0) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= ~ARR_SIZE~0 2) (exists ((v_DerPreprocessor_3 Int)) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 0) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))))} is VALID [2022-02-20 14:24:06,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= ~ARR_SIZE~0 2) (exists ((v_DerPreprocessor_3 Int)) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 0) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))))} assume !(0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2)); {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= ~ARR_SIZE~0 2) (exists ((v_DerPreprocessor_3 Int)) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 0) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))))} is VALID [2022-02-20 14:24:06,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= ~ARR_SIZE~0 2) (exists ((v_DerPreprocessor_3 Int)) (= (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|) (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|) v_DerPreprocessor_3) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) 0) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))))))} assume 1 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 1 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~num~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1810#(and (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {1810#(and (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (<= ~ARR_SIZE~0 2))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1810#(and (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {1810#(and (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (<= ~ARR_SIZE~0 2))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1810#(and (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {1810#(and (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (<= ~ARR_SIZE~0 2))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1820#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= |ULTIMATE.start_main_~row~0#1| 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:06,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {1820#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= |ULTIMATE.start_main_~row~0#1| 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1824#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {1824#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} main_~row~0#1 := 0; {1828#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {1828#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1832#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {1832#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1836#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {1836#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1840#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {1840#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1844#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {1844#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1844#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {1844#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1844#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {1844#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2))} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1854#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:24:06,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {1854#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1858#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:24:06,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {1858#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1858#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:24:06,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {1858#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1865#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:24:06,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {1865#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1869#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {1869#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1869#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {1869#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1869#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {1869#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1869#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {1869#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1869#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:06,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {1869#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || main_~sum~0#1 == ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1885#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:24:06,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {1885#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1730#false} is VALID [2022-02-20 14:24:06,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {1730#false} assume !false; {1730#false} is VALID [2022-02-20 14:24:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:24:06,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:23,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2022-02-20 14:24:26,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:24:26,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 125 [2022-02-20 14:24:33,555 INFO L356 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2022-02-20 14:24:33,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 6 [2022-02-20 14:25:07,455 WARN L228 SmtUtils]: Spent 32.02s on a formula simplification. DAG size of input: 142 DAG size of output: 98 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-02-20 14:25:07,471 INFO L356 Elim1Store]: treesize reduction 260, result has 56.4 percent of original size [2022-02-20 14:25:07,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 6827176 treesize of output 6442459