./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array28_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/array28_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 8b49bb3ea989868d96c18ff859c95dc74ebb805f64994c11617c2c5b61c8e87f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:24:12,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:24:12,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:24:12,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:24:12,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:24:12,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:24:12,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:24:12,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:24:12,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:24:12,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:24:12,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:24:12,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:24:12,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:24:12,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:24:12,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:24:12,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:24:12,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:24:12,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:24:12,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:24:12,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:24:12,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:24:12,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:24:12,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:24:12,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:24:12,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:24:12,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:24:12,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:24:12,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:24:12,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:24:12,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:24:12,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:24:12,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:24:12,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:24:12,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:24:12,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:24:12,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:24:12,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:24:12,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:24:12,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:24:12,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:24:12,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:24:12,224 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:24:12,246 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:24:12,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:24:12,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:24:12,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:24:12,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:24:12,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:24:12,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:24:12,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:24:12,249 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:24:12,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:24:12,250 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:24:12,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:24:12,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:24:12,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:24:12,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:24:12,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:24:12,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:24:12,251 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:24:12,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:24:12,251 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:24:12,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:24:12,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:24:12,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:24:12,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:24:12,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:12,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:24:12,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:24:12,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:24:12,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:24:12,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:24:12,253 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:24:12,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:24:12,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:24:12,254 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 -> 8b49bb3ea989868d96c18ff859c95dc74ebb805f64994c11617c2c5b61c8e87f [2022-02-20 14:24:12,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:24:12,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:24:12,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:24:12,542 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:24:12,542 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:24:12,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array28_pattern.c [2022-02-20 14:24:12,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7e40428/b7f0021049d94cf4a1d036da587e2bee/FLAG5be798cd3 [2022-02-20 14:24:12,971 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:24:12,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array28_pattern.c [2022-02-20 14:24:12,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7e40428/b7f0021049d94cf4a1d036da587e2bee/FLAG5be798cd3 [2022-02-20 14:24:12,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7e40428/b7f0021049d94cf4a1d036da587e2bee [2022-02-20 14:24:12,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:24:12,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:24:12,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:12,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:24:12,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:24:12,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:12" (1/1) ... [2022-02-20 14:24:12,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13516033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:12, skipping insertion in model container [2022-02-20 14:24:12,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:12" (1/1) ... [2022-02-20 14:24:13,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:24:13,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:24:13,170 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/array28_pattern.c[1246,1259] [2022-02-20 14:24:13,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:13,209 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:24:13,232 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/array28_pattern.c[1246,1259] [2022-02-20 14:24:13,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:13,258 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:24:13,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:13 WrapperNode [2022-02-20 14:24:13,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:13,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:13,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:24:13,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:24:13,266 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:24:13" (1/1) ... [2022-02-20 14:24:13,279 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:24:13" (1/1) ... [2022-02-20 14:24:13,312 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2022-02-20 14:24:13,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:13,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:24:13,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:24:13,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:24:13,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:13" (1/1) ... [2022-02-20 14:24:13,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:13" (1/1) ... [2022-02-20 14:24:13,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:13" (1/1) ... [2022-02-20 14:24:13,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:13" (1/1) ... [2022-02-20 14:24:13,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:13" (1/1) ... [2022-02-20 14:24:13,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:13" (1/1) ... [2022-02-20 14:24:13,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:13" (1/1) ... [2022-02-20 14:24:13,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:24:13,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:24:13,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:24:13,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:24:13,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:13" (1/1) ... [2022-02-20 14:24:13,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:13,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:13,379 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:24:13,382 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:24:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:24:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:24:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:24:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:24:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:24:13,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:24:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:24:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:24:13,453 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:24:13,454 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:24:13,614 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:24:13,619 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:24:13,619 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:24:13,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:13 BoogieIcfgContainer [2022-02-20 14:24:13,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:24:13,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:24:13,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:24:13,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:24:13,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:24:12" (1/3) ... [2022-02-20 14:24:13,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5023df52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:13, skipping insertion in model container [2022-02-20 14:24:13,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:13" (2/3) ... [2022-02-20 14:24:13,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5023df52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:13, skipping insertion in model container [2022-02-20 14:24:13,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:13" (3/3) ... [2022-02-20 14:24:13,627 INFO L111 eAbstractionObserver]: Analyzing ICFG array28_pattern.c [2022-02-20 14:24:13,631 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:24:13,631 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:24:13,669 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:24:13,675 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:24:13,675 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:24:13,702 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:24:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:24:13,712 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:13,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:13,728 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:13,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash -320975489, now seen corresponding path program 1 times [2022-02-20 14:24:13,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:13,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825960165] [2022-02-20 14:24:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:13,895 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:24:13,907 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 > 0 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:24:13,908 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:24:13,909 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:24:13,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#false} assume !true; {27#false} is VALID [2022-02-20 14:24:13,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#false} main_~row~0#1 := 0; {27#false} is VALID [2022-02-20 14:24:13,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {27#false} is VALID [2022-02-20 14:24:13,910 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 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:24:13,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 == __VERIFIER_assert_~cond#1; {27#false} is VALID [2022-02-20 14:24:13,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 14:24:13,911 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:24:13,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:13,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825960165] [2022-02-20 14:24:13,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825960165] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:13,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:13,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:24:13,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976500625] [2022-02-20 14:24:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:13,919 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:24:13,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:13,922 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:24:13,936 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:24:13,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:24:13,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:13,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:24:13,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:24:13,956 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:24:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:14,007 INFO L93 Difference]: Finished difference Result 43 states and 64 transitions. [2022-02-20 14:24:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:24:14,008 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:24:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:14,009 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:24:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 14:24:14,019 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:24:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 14:24:14,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2022-02-20 14:24:14,108 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:24:14,115 INFO L225 Difference]: With dead ends: 43 [2022-02-20 14:24:14,116 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 14:24:14,119 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:24:14,122 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:24:14,123 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:24:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 14:24:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 14:24:14,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:14,153 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:24:14,154 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:24:14,154 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:24:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:14,159 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 14:24:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 14:24:14,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:14,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:14,161 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:24:14,162 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:24:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:14,165 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 14:24:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 14:24:14,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:14,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:14,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:14,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:14,169 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:24:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-02-20 14:24:14,180 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2022-02-20 14:24:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:14,181 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-20 14:24:14,181 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:24:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 14:24:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:24:14,182 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:14,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:14,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:24:14,185 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:14,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:14,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1931938343, now seen corresponding path program 1 times [2022-02-20 14:24:14,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:14,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987257622] [2022-02-20 14:24:14,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:14,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:14,219 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:14,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261078324] [2022-02-20 14:24:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:14,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:14,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:14,235 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:24:14,241 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:24:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:14,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:24:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:14,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:14,390 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:24:14,391 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 > 0 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:24:14,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#true} assume !(0 == assume_abort_if_not_~cond#1); {144#true} is VALID [2022-02-20 14:24:14,391 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:24:14,392 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:24:14,392 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:24:14,393 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:24:14,394 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 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:24:14,394 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:24:14,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {145#false} assume !false; {145#false} is VALID [2022-02-20 14:24:14,395 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:24:14,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:14,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:14,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987257622] [2022-02-20 14:24:14,396 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:14,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261078324] [2022-02-20 14:24:14,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261078324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:14,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:14,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:24:14,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076170748] [2022-02-20 14:24:14,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:14,398 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:24:14,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:14,399 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:24:14,408 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:24:14,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:24:14,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:24:14,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:24:14,409 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:24:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:14,472 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 14:24:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:24:14,473 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:24:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:14,473 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:24:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 14:24:14,476 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:24:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 14:24:14,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-20 14:24:14,511 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:24:14,513 INFO L225 Difference]: With dead ends: 26 [2022-02-20 14:24:14,513 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 14:24:14,513 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:24:14,516 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:24:14,516 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:24:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 14:24:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 14:24:14,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:14,532 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:24:14,532 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:24:14,533 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:24:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:14,535 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-02-20 14:24:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 14:24:14,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:14,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:14,538 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:24:14,539 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:24:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:14,541 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-02-20 14:24:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 14:24:14,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:14,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:14,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:14,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:14,543 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:24:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-20 14:24:14,544 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2022-02-20 14:24:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:14,544 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-20 14:24:14,544 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:24:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 14:24:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:24:14,545 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:14,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:14,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:24:14,759 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:24:14,760 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash -94215630, now seen corresponding path program 1 times [2022-02-20 14:24:14,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:14,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209488771] [2022-02-20 14:24:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:14,780 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:14,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1124685491] [2022-02-20 14:24:14,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:14,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:14,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:14,783 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:24:14,795 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:24:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:14,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:24:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:14,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:15,014 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:24:15,016 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 > 0 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:24:15,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume !(0 == assume_abort_if_not_~cond#1); {283#true} is VALID [2022-02-20 14:24:15,017 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:24:15,018 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:24:15,019 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:24:15,019 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:24:15,020 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:24:15,020 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:24:15,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {284#false} is VALID [2022-02-20 14:24:15,020 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:24:15,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {284#false} is VALID [2022-02-20 14:24:15,021 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 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:24:15,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#false} assume 0 == __VERIFIER_assert_~cond#1; {284#false} is VALID [2022-02-20 14:24:15,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-02-20 14:24:15,022 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:24:15,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:15,025 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:15,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209488771] [2022-02-20 14:24:15,026 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:15,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124685491] [2022-02-20 14:24:15,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124685491] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:15,027 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:15,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:24:15,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040463062] [2022-02-20 14:24:15,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:15,034 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:24:15,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:15,034 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:24:15,053 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:24:15,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:24:15,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:15,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:24:15,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:15,055 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:24:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:15,178 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-02-20 14:24:15,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:24:15,179 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:24:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:15,179 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:24:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-02-20 14:24:15,180 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:24:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-02-20 14:24:15,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2022-02-20 14:24:15,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:15,229 INFO L225 Difference]: With dead ends: 47 [2022-02-20 14:24:15,229 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:24:15,230 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:24:15,232 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:15,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:15,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:24:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2022-02-20 14:24:15,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:15,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:15,247 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:15,248 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:15,249 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-20 14:24:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 14:24:15,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:15,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:15,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 14:24:15,250 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 14:24:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:15,252 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-20 14:24:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 14:24:15,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:15,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:15,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:15,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-02-20 14:24:15,254 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 15 [2022-02-20 14:24:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:15,255 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-02-20 14:24:15,255 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:24:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 14:24:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:24:15,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:15,256 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:24:15,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:24:15,482 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:24:15,482 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash -169454663, now seen corresponding path program 1 times [2022-02-20 14:24:15,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:15,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238959717] [2022-02-20 14:24:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:15,502 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:15,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775503730] [2022-02-20 14:24:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:15,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:15,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:15,509 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:24:15,552 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:24:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:15,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:24:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:15,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:15,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {497#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; {497#true} is VALID [2022-02-20 14:24:15,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#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 > 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {497#true} is VALID [2022-02-20 14:24:15,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#true} assume !(0 == assume_abort_if_not_~cond#1); {497#true} is VALID [2022-02-20 14:24:15,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {497#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; {511#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:24:15,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {511#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {515#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:15,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {498#false} is VALID [2022-02-20 14:24:15,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {498#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {498#false} is VALID [2022-02-20 14:24:15,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {498#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {498#false} is VALID [2022-02-20 14:24:15,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {498#false} main_~row~0#1 := 0; {498#false} is VALID [2022-02-20 14:24:15,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {498#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {498#false} is VALID [2022-02-20 14:24:15,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {498#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; {498#false} is VALID [2022-02-20 14:24:15,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {498#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {498#false} is VALID [2022-02-20 14:24:15,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {498#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {498#false} is VALID [2022-02-20 14:24:15,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {498#false} is VALID [2022-02-20 14:24:15,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {498#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {498#false} is VALID [2022-02-20 14:24:15,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {498#false} is VALID [2022-02-20 14:24:15,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {498#false} assume 0 == __VERIFIER_assert_~cond#1; {498#false} is VALID [2022-02-20 14:24:15,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {498#false} assume !false; {498#false} is VALID [2022-02-20 14:24:15,695 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:24:15,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:15,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:15,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238959717] [2022-02-20 14:24:15,696 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:15,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775503730] [2022-02-20 14:24:15,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775503730] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:15,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:15,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:24:15,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071682757] [2022-02-20 14:24:15,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:15,698 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:15,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:15,699 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:24:15,712 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:24:15,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:24:15,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:24:15,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:24:15,715 INFO L87 Difference]: Start difference. First operand 23 states and 29 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:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:15,854 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-02-20 14:24:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:24:15,854 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:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:15,855 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:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 14:24:15,856 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:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 14:24:15,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-02-20 14:24:15,904 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:15,905 INFO L225 Difference]: With dead ends: 46 [2022-02-20 14:24:15,905 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 14:24:15,905 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:15,906 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:15,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 17 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 14:24:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 14:24:15,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:15,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:15,920 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:15,920 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:15,922 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 14:24:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 14:24:15,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:15,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:15,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 14:24:15,923 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 14:24:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:15,924 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 14:24:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 14:24:15,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:15,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:15,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:15,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 14:24:15,926 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 18 [2022-02-20 14:24:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:15,927 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 14:24:15,927 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:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 14:24:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:24:15,928 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:15,928 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:15,953 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:16,151 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:16,152 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:16,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash -308201553, now seen corresponding path program 1 times [2022-02-20 14:24:16,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:16,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391482201] [2022-02-20 14:24:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:16,169 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:16,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107702737] [2022-02-20 14:24:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:16,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:16,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:16,171 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:16,181 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:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:16,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:24:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:16,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:16,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {706#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; {706#true} is VALID [2022-02-20 14:24:16,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {706#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 > 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {706#true} is VALID [2022-02-20 14:24:16,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {706#true} assume !(0 == assume_abort_if_not_~cond#1); {706#true} is VALID [2022-02-20 14:24:16,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {706#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; {720#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:24:16,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {720#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {724#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:16,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {724#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:16,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {724#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume main_~row~0#1 > main_~column~0#1;call write~int(main_~row~0#1 + main_~column~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); {707#false} is VALID [2022-02-20 14:24:16,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#false} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {707#false} is VALID [2022-02-20 14:24:16,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {707#false} is VALID [2022-02-20 14:24:16,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {707#false} is VALID [2022-02-20 14:24:16,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {707#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {707#false} is VALID [2022-02-20 14:24:16,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#false} main_~row~0#1 := 0; {707#false} is VALID [2022-02-20 14:24:16,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {707#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {707#false} is VALID [2022-02-20 14:24:16,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {707#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; {707#false} is VALID [2022-02-20 14:24:16,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {707#false} is VALID [2022-02-20 14:24:16,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {707#false} is VALID [2022-02-20 14:24:16,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {707#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {707#false} is VALID [2022-02-20 14:24:16,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {707#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {707#false} is VALID [2022-02-20 14:24:16,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {707#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {707#false} is VALID [2022-02-20 14:24:16,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {707#false} assume 0 == __VERIFIER_assert_~cond#1; {707#false} is VALID [2022-02-20 14:24:16,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {707#false} assume !false; {707#false} is VALID [2022-02-20 14:24:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:24:16,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:16,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:16,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391482201] [2022-02-20 14:24:16,344 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:16,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107702737] [2022-02-20 14:24:16,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107702737] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:16,344 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:16,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:24:16,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568495072] [2022-02-20 14:24:16,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:16,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:24:16,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:16,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:16,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:16,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:24:16,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:16,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:24:16,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:24:16,363 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:16,460 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-02-20 14:24:16,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:24:16,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:24:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-02-20 14:24:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-02-20 14:24:16,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-02-20 14:24:16,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:16,510 INFO L225 Difference]: With dead ends: 57 [2022-02-20 14:24:16,510 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:24:16,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:24:16,511 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:16,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 21 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:24:16,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-02-20 14:24:16,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:16,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:16,533 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:16,533 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:16,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:16,534 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 14:24:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-20 14:24:16,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:16,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:16,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 14:24:16,535 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 14:24:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:16,537 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 14:24:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-20 14:24:16,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:16,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:16,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:16,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-02-20 14:24:16,539 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 21 [2022-02-20 14:24:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:16,539 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-20 14:24:16,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:16,540 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 14:24:16,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:24:16,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:16,540 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, 1] [2022-02-20 14:24:16,566 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:16,759 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:16,759 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:16,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:16,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1924412114, now seen corresponding path program 1 times [2022-02-20 14:24:16,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:16,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801617266] [2022-02-20 14:24:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:16,776 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:16,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586628651] [2022-02-20 14:24:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:16,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:16,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:16,786 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:16,810 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:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:16,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 14:24:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:16,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:16,985 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 37 treesize of output 32 [2022-02-20 14:24:16,997 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 8 treesize of output 7 [2022-02-20 14:24:17,004 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 8 treesize of output 7 [2022-02-20 14:24:17,283 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 36 treesize of output 24 [2022-02-20 14:24:17,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {964#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; {964#true} is VALID [2022-02-20 14:24:17,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {964#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 > 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {964#true} is VALID [2022-02-20 14:24:17,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {964#true} assume !(0 == assume_abort_if_not_~cond#1); {964#true} is VALID [2022-02-20 14:24:17,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {964#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; {978#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:24:17,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {978#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {982#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:17,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {982#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {982#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:17,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {982#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~row~0#1 > main_~column~0#1); {982#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:17,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {982#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~row~0#1 < main_~column~0#1);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); {992#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:24:17,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {992#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {992#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:24:17,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {992#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {992#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:24:17,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {992#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {992#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:24:17,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {992#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {992#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:24:17,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {992#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} main_~row~0#1 := 0; {1008#(and (= |ULTIMATE.start_main_~sum~0#1| 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|) 0))} is VALID [2022-02-20 14:24:17,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {1008#(and (= |ULTIMATE.start_main_~sum~0#1| 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|) 0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1012#(and (= |ULTIMATE.start_main_~sum~0#1| 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|) 0))} is VALID [2022-02-20 14:24:17,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {1012#(and (= |ULTIMATE.start_main_~sum~0#1| 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|) 0))} 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; {1016#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:17,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {1016#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1016#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:17,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {1016#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1016#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:17,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {1016#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1016#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:17,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {1016#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1016#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:17,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {1016#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1032#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:24:17,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {1032#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {965#false} is VALID [2022-02-20 14:24:17,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {965#false} assume !false; {965#false} is VALID [2022-02-20 14:24:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:24:17,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:17,820 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 56 treesize of output 52 [2022-02-20 14:24:17,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:24:17,901 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 52 treesize of output 121 [2022-02-20 14:24:18,190 INFO L356 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2022-02-20 14:24:18,191 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 82 treesize of output 4 [2022-02-20 14:24:18,924 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:24:18,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 162