./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array29_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/array29_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 c79b0cfbfa84c2390344382edf3f60a855c5e1f87aaed3ee77c2dd6c5f017188 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:24:28,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:24:28,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:24:28,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:24:28,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:24:28,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:24:28,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:24:28,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:24:28,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:24:28,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:24:28,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:24:28,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:24:28,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:24:28,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:24:28,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:24:28,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:24:28,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:24:28,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:24:28,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:24:28,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:24:28,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:24:28,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:24:28,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:24:28,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:24:28,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:24:28,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:24:28,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:24:28,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:24:28,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:24:28,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:24:28,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:24:28,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:24:28,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:24:28,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:24:28,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:24:28,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:24:28,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:24:28,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:24:28,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:24:28,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:24:28,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:24:28,241 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:28,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:24:28,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:24:28,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:24:28,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:24:28,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:24:28,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:24:28,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:24:28,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:24:28,275 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:24:28,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:24:28,276 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:24:28,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:24:28,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:24:28,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:24:28,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:24:28,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:24:28,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:24:28,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:24:28,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:24:28,277 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:24:28,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:24:28,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:24:28,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:24:28,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:24:28,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:28,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:24:28,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:24:28,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:24:28,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:24:28,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:24:28,281 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:24:28,281 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:24:28,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:24:28,281 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 -> c79b0cfbfa84c2390344382edf3f60a855c5e1f87aaed3ee77c2dd6c5f017188 [2022-02-20 14:24:28,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:24:28,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:24:28,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:24:28,546 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:24:28,547 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:24:28,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array29_pattern.c [2022-02-20 14:24:28,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75dc3b3df/4904d6bf359e4f6e83d7ed547560fbfc/FLAG5b9847445 [2022-02-20 14:24:28,961 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:24:28,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array29_pattern.c [2022-02-20 14:24:28,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75dc3b3df/4904d6bf359e4f6e83d7ed547560fbfc/FLAG5b9847445 [2022-02-20 14:24:29,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75dc3b3df/4904d6bf359e4f6e83d7ed547560fbfc [2022-02-20 14:24:29,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:24:29,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:24:29,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:29,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:24:29,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:24:29,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:29" (1/1) ... [2022-02-20 14:24:29,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5049ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:29, skipping insertion in model container [2022-02-20 14:24:29,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:29" (1/1) ... [2022-02-20 14:24:29,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:24:29,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:24:29,554 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/array29_pattern.c[1255,1268] [2022-02-20 14:24:29,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:29,580 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:24:29,591 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/array29_pattern.c[1255,1268] [2022-02-20 14:24:29,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:29,612 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:24:29,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:29 WrapperNode [2022-02-20 14:24:29,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:29,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:29,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:24:29,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:24:29,618 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:29" (1/1) ... [2022-02-20 14:24:29,623 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:29" (1/1) ... [2022-02-20 14:24:29,643 INFO L137 Inliner]: procedures = 16, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2022-02-20 14:24:29,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:29,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:24:29,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:24:29,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:24:29,653 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:29" (1/1) ... [2022-02-20 14:24:29,654 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:29" (1/1) ... [2022-02-20 14:24:29,656 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:29" (1/1) ... [2022-02-20 14:24:29,656 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:29" (1/1) ... [2022-02-20 14:24:29,661 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:29" (1/1) ... [2022-02-20 14:24:29,664 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:29" (1/1) ... [2022-02-20 14:24:29,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:29" (1/1) ... [2022-02-20 14:24:29,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:24:29,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:24:29,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:24:29,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:24:29,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:29" (1/1) ... [2022-02-20 14:24:29,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:29,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:29,698 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:29,708 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:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:24:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:24:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:24:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:24:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:24:29,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:24:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:24:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:24:29,779 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:24:29,780 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:24:29,930 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:24:29,936 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:24:29,936 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:24:29,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:29 BoogieIcfgContainer [2022-02-20 14:24:29,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:24:29,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:24:29,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:24:29,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:24:29,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:24:29" (1/3) ... [2022-02-20 14:24:29,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13adfe2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:29, skipping insertion in model container [2022-02-20 14:24:29,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:29" (2/3) ... [2022-02-20 14:24:29,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13adfe2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:29, skipping insertion in model container [2022-02-20 14:24:29,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:29" (3/3) ... [2022-02-20 14:24:29,944 INFO L111 eAbstractionObserver]: Analyzing ICFG array29_pattern.c [2022-02-20 14:24:29,948 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:24:29,949 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:24:29,986 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:24:29,990 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:29,991 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:24:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:24:30,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:30,007 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:30,008 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -468356531, now seen corresponding path program 1 times [2022-02-20 14:24:30,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:30,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689798438] [2022-02-20 14:24:30,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:30,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#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; {25#true} is VALID [2022-02-20 14:24:30,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#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_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {25#true} is VALID [2022-02-20 14:24:30,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {26#false} is VALID [2022-02-20 14:24:30,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#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_~sum~0#1 := 0;main_~row~0#1 := 0; {26#false} is VALID [2022-02-20 14:24:30,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#false} assume !true; {26#false} is VALID [2022-02-20 14:24:30,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#false} main_~row~0#1 := 0; {26#false} is VALID [2022-02-20 14:24:30,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#false} assume !true; {26#false} is VALID [2022-02-20 14:24:30,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 == ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {26#false} is VALID [2022-02-20 14:24:30,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} assume 0 == __VERIFIER_assert_~cond#1; {26#false} is VALID [2022-02-20 14:24:30,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 14:24:30,235 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:30,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:30,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689798438] [2022-02-20 14:24:30,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689798438] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:30,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:30,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:24:30,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8565302] [2022-02-20 14:24:30,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:30,249 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:30,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:30,253 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:30,284 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:30,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:24:30,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:24:30,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:24:30,310 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:30,361 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-02-20 14:24:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:24:30,361 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:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:30,363 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:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 14:24:30,372 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:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 14:24:30,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2022-02-20 14:24:30,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:30,482 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:24:30,483 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 14:24:30,485 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:30,502 INFO L933 BasicCegarLoop]: 26 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, 26 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:30,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 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:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 14:24:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 14:24:30,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:30,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:30,541 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:30,542 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:30,546 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-20 14:24:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-20 14:24:30,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:30,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:30,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 14:24:30,549 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 14:24:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:30,552 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-20 14:24:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-20 14:24:30,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:30,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:30,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:30,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-02-20 14:24:30,558 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-02-20 14:24:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:30,559 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-02-20 14:24:30,559 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:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-20 14:24:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:24:30,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:30,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:30,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:24:30,563 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1936709868, now seen corresponding path program 1 times [2022-02-20 14:24:30,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:30,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855065757] [2022-02-20 14:24:30,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:30,604 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:30,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926051734] [2022-02-20 14:24:30,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:30,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:30,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:30,613 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:30,614 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:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:30,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:24:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:30,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:30,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {138#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; {138#true} is VALID [2022-02-20 14:24:30,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#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_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {146#(or (and (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 1 ~ARR_SIZE~0)))} is VALID [2022-02-20 14:24:30,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#(or (and (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 1 ~ARR_SIZE~0)))} assume !(0 == assume_abort_if_not_~cond#1); {150#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:30,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#(< 1 ~ARR_SIZE~0)} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~sum~0#1 := 0;main_~row~0#1 := 0; {154#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:30,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {154#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {139#false} is VALID [2022-02-20 14:24:30,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#false} main_~row~0#1 := 0; {139#false} is VALID [2022-02-20 14:24:30,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {139#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {139#false} is VALID [2022-02-20 14:24:30,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 == ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {139#false} is VALID [2022-02-20 14:24:30,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {139#false} assume 0 == __VERIFIER_assert_~cond#1; {139#false} is VALID [2022-02-20 14:24:30,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {139#false} assume !false; {139#false} is VALID [2022-02-20 14:24:30,936 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:30,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:30,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:30,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855065757] [2022-02-20 14:24:30,938 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:30,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926051734] [2022-02-20 14:24:30,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926051734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:30,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:30,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:24:30,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759206407] [2022-02-20 14:24:30,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:24:30,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:30,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:30,957 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:30,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:24:30,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:30,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:24:30,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:30,959 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:31,120 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-20 14:24:31,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:24:31,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:24:31,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 14:24:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 14:24:31,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-02-20 14:24:31,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:31,167 INFO L225 Difference]: With dead ends: 36 [2022-02-20 14:24:31,168 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:24:31,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:24:31,169 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 58 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:31,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 11 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:31,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:24:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-02-20 14:24:31,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:31,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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:31,181 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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:31,181 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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:31,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:31,182 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 14:24:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 14:24:31,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:31,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:31,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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 27 states. [2022-02-20 14:24:31,184 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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 27 states. [2022-02-20 14:24:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:31,185 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 14:24:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 14:24:31,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:31,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:31,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:31,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-02-20 14:24:31,188 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2022-02-20 14:24:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:31,188 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-20 14:24:31,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-20 14:24:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:24:31,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:31,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:31,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:24:31,417 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:31,418 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:31,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash 129650620, now seen corresponding path program 1 times [2022-02-20 14:24:31,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:31,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878687184] [2022-02-20 14:24:31,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:31,435 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:31,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587896414] [2022-02-20 14:24:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:31,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:31,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:31,437 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:31,466 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:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:31,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:24:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:31,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:31,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#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; {302#true} is VALID [2022-02-20 14:24:31,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#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_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {302#true} is VALID [2022-02-20 14:24:31,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume !(0 == assume_abort_if_not_~cond#1); {302#true} is VALID [2022-02-20 14:24:31,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {302#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_~sum~0#1 := 0;main_~row~0#1 := 0; {316#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:24:31,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {316#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {320#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:31,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {320#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {303#false} is VALID [2022-02-20 14:24:31,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {303#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {303#false} is VALID [2022-02-20 14:24:31,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {303#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {303#false} is VALID [2022-02-20 14:24:31,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {303#false} main_~row~0#1 := 0; {303#false} is VALID [2022-02-20 14:24:31,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {303#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {303#false} is VALID [2022-02-20 14:24:31,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {303#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {303#false} is VALID [2022-02-20 14:24:31,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {303#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {303#false} is VALID [2022-02-20 14:24:31,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {303#false} is VALID [2022-02-20 14:24:31,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {303#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 == ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {303#false} is VALID [2022-02-20 14:24:31,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {303#false} assume 0 == __VERIFIER_assert_~cond#1; {303#false} is VALID [2022-02-20 14:24:31,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {303#false} assume !false; {303#false} is VALID [2022-02-20 14:24:31,583 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:31,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:31,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:31,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878687184] [2022-02-20 14:24:31,584 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:31,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587896414] [2022-02-20 14:24:31,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587896414] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:31,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:31,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:24:31,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683955809] [2022-02-20 14:24:31,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:31,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 14:24:31,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:31,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:31,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:31,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:24:31,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:31,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:24:31,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:24:31,599 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:31,719 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-02-20 14:24:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:24:31,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 14:24:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 14:24:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 14:24:31,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-02-20 14:24:31,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:31,777 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:24:31,777 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 14:24:31,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:31,780 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:31,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 16 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 14:24:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-02-20 14:24:31,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:31,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 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:31,812 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 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:31,813 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 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:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:31,814 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 14:24:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 14:24:31,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:31,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:31,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 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 25 states. [2022-02-20 14:24:31,815 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 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 25 states. [2022-02-20 14:24:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:31,816 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 14:24:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 14:24:31,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:31,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:31,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:31,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 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:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 14:24:31,818 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-02-20 14:24:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:31,818 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 14:24:31,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 14:24:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:24:31,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:31,819 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:31,850 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:32,037 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:32,038 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:32,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1705469543, now seen corresponding path program 1 times [2022-02-20 14:24:32,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:32,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865857715] [2022-02-20 14:24:32,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:32,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:32,056 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:32,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019267029] [2022-02-20 14:24:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:32,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:32,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:32,062 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:32,068 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:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:32,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:24:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:32,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:32,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {488#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; {488#true} is VALID [2022-02-20 14:24:32,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {488#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_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {496#(or (and (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 1 ~ARR_SIZE~0)))} is VALID [2022-02-20 14:24:32,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {496#(or (and (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 1 ~ARR_SIZE~0)))} assume !(0 == assume_abort_if_not_~cond#1); {500#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:32,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {500#(< 1 ~ARR_SIZE~0)} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~sum~0#1 := 0;main_~row~0#1 := 0; {500#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:32,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {500#(< 1 ~ARR_SIZE~0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {507#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:32,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {507#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:32,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {507#(and (< 1 ~ARR_SIZE~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_~row~0#1, 4); {507#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:32,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {517#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:24:32,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {517#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {489#false} is VALID [2022-02-20 14:24:32,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {489#false} is VALID [2022-02-20 14:24:32,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {489#false} is VALID [2022-02-20 14:24:32,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#false} main_~row~0#1 := 0; {489#false} is VALID [2022-02-20 14:24:32,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {489#false} is VALID [2022-02-20 14:24:32,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#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; {489#false} is VALID [2022-02-20 14:24:32,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {489#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {489#false} is VALID [2022-02-20 14:24:32,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {489#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {489#false} is VALID [2022-02-20 14:24:32,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {489#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {489#false} is VALID [2022-02-20 14:24:32,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {489#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {489#false} is VALID [2022-02-20 14:24:32,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {489#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 == ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {489#false} is VALID [2022-02-20 14:24:32,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {489#false} assume 0 == __VERIFIER_assert_~cond#1; {489#false} is VALID [2022-02-20 14:24:32,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {489#false} assume !false; {489#false} is VALID [2022-02-20 14:24:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:24:32,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:32,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {489#false} assume !false; {489#false} is VALID [2022-02-20 14:24:32,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {489#false} assume 0 == __VERIFIER_assert_~cond#1; {489#false} is VALID [2022-02-20 14:24:32,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {489#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 == ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {489#false} is VALID [2022-02-20 14:24:32,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {489#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {489#false} is VALID [2022-02-20 14:24:32,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {489#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {489#false} is VALID [2022-02-20 14:24:32,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {489#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {489#false} is VALID [2022-02-20 14:24:32,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {489#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {489#false} is VALID [2022-02-20 14:24:32,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#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; {489#false} is VALID [2022-02-20 14:24:32,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {489#false} is VALID [2022-02-20 14:24:32,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#false} main_~row~0#1 := 0; {489#false} is VALID [2022-02-20 14:24:32,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {489#false} is VALID [2022-02-20 14:24:32,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {489#false} is VALID [2022-02-20 14:24:32,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {593#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {489#false} is VALID [2022-02-20 14:24:32,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {593#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:32,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~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_~row~0#1, 4); {597#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:32,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {597#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:32,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {500#(< 1 ~ARR_SIZE~0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {597#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:32,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {500#(< 1 ~ARR_SIZE~0)} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~sum~0#1 := 0;main_~row~0#1 := 0; {500#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:32,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#(or (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} assume !(0 == assume_abort_if_not_~cond#1); {500#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:32,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {488#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_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {613#(or (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} is VALID [2022-02-20 14:24:32,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {488#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; {488#true} is VALID [2022-02-20 14:24:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:24:32,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:32,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865857715] [2022-02-20 14:24:32,457 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:32,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019267029] [2022-02-20 14:24:32,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019267029] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:24:32,457 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:24:32,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-02-20 14:24:32,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820333682] [2022-02-20 14:24:32,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:24:32,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:24:32,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:32,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:32,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:32,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:24:32,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:32,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:24:32,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:24:32,487 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:32,754 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-02-20 14:24:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:24:32,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:24:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-02-20 14:24:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-02-20 14:24:32,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-02-20 14:24:32,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:32,808 INFO L225 Difference]: With dead ends: 47 [2022-02-20 14:24:32,808 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 14:24:32,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:24:32,809 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:32,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 12 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:24:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 14:24:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-02-20 14:24:32,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:32,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:32,833 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:32,833 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:32,834 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 14:24:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 14:24:32,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:32,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:32,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 14:24:32,835 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 14:24:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:32,837 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 14:24:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 14:24:32,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:32,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:32,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:32,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-02-20 14:24:32,845 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 21 [2022-02-20 14:24:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:32,845 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-02-20 14:24:32,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-02-20 14:24:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:24:32,846 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:32,846 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:32,867 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:33,055 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:33,056 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:33,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash 943008096, now seen corresponding path program 2 times [2022-02-20 14:24:33,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:33,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279871301] [2022-02-20 14:24:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:33,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:33,086 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:33,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [511803766] [2022-02-20 14:24:33,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:24:33,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:33,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:33,088 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:33,090 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:33,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:24:33,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:24:33,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:24:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:33,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:33,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#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; {788#true} is VALID [2022-02-20 14:24:33,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#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_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {788#true} is VALID [2022-02-20 14:24:33,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume !(0 == assume_abort_if_not_~cond#1); {788#true} is VALID [2022-02-20 14:24:33,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {788#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_~sum~0#1 := 0;main_~row~0#1 := 0; {802#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:24:33,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {802#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {806#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:33,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {806#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {806#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:33,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {806#(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(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_~row~0#1, 4); {806#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:33,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {806#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {816#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:33,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {816#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:33,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {816#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} 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_~row~0#1, 4); {789#false} is VALID [2022-02-20 14:24:33,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {789#false} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {789#false} is VALID [2022-02-20 14:24:33,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {789#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {789#false} is VALID [2022-02-20 14:24:33,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {789#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {789#false} is VALID [2022-02-20 14:24:33,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {789#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {789#false} is VALID [2022-02-20 14:24:33,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {789#false} main_~row~0#1 := 0; {789#false} is VALID [2022-02-20 14:24:33,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {789#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {789#false} is VALID [2022-02-20 14:24:33,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {789#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; {789#false} is VALID [2022-02-20 14:24:33,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {789#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {789#false} is VALID [2022-02-20 14:24:33,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {789#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; {789#false} is VALID [2022-02-20 14:24:33,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {789#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {789#false} is VALID [2022-02-20 14:24:33,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {789#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {789#false} is VALID [2022-02-20 14:24:33,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {789#false} is VALID [2022-02-20 14:24:33,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {789#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {789#false} is VALID [2022-02-20 14:24:33,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {789#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 == ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {789#false} is VALID [2022-02-20 14:24:33,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {789#false} assume 0 == __VERIFIER_assert_~cond#1; {789#false} is VALID [2022-02-20 14:24:33,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-02-20 14:24:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:24:33,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:33,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:33,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279871301] [2022-02-20 14:24:33,272 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:33,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511803766] [2022-02-20 14:24:33,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511803766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:33,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:33,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:24:33,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627923003] [2022-02-20 14:24:33,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:33,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 14:24:33,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:33,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:33,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:33,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:24:33,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:33,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:24:33,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:33,292 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:33,441 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-02-20 14:24:33,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:24:33,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 14:24:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-02-20 14:24:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-02-20 14:24:33,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-02-20 14:24:33,493 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:33,494 INFO L225 Difference]: With dead ends: 63 [2022-02-20 14:24:33,494 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 14:24:33,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:33,495 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:33,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 14:24:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-02-20 14:24:33,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:33,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:33,526 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:33,526 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:33,528 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-02-20 14:24:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-02-20 14:24:33,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:33,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:33,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 14:24:33,529 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 14:24:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:33,531 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-02-20 14:24:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-02-20 14:24:33,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:33,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:33,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:33,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-02-20 14:24:33,533 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 26 [2022-02-20 14:24:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:33,533 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-02-20 14:24:33,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-02-20 14:24:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:24:33,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:33,534 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:33,565 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:33,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:33,759 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:33,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:33,760 INFO L85 PathProgramCache]: Analyzing trace with hash -645339806, now seen corresponding path program 1 times [2022-02-20 14:24:33,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:33,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843542604] [2022-02-20 14:24:33,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:33,779 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:33,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687758264] [2022-02-20 14:24:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:33,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:33,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:33,796 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:33,811 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:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:33,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:24:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:33,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:34,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {1087#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; {1087#true} is VALID [2022-02-20 14:24:34,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1087#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_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1087#true} is VALID [2022-02-20 14:24:34,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1087#true} assume !(0 == assume_abort_if_not_~cond#1); {1087#true} is VALID [2022-02-20 14:24:34,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {1087#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_~sum~0#1 := 0;main_~row~0#1 := 0; {1101#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:24:34,098 INFO L290 TraceCheckUtils]: 4: Hoare triple {1101#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1105#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:34,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {1105#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1105#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:34,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {1105#(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(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_~row~0#1, 4); {1105#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:34,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {1105#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1115#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:34,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {1115#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1119#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:34,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {1119#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(main_~row~0#1 == main_~column~0#1);call write~int(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); {1119#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:34,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {1119#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1119#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:34,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {1119#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1119#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:34,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {1119#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1132#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:24:34,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {1132#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1088#false} is VALID [2022-02-20 14:24:34,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {1088#false} main_~row~0#1 := 0; {1088#false} is VALID [2022-02-20 14:24:34,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {1088#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1088#false} is VALID [2022-02-20 14:24:34,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {1088#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; {1088#false} is VALID [2022-02-20 14:24:34,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {1088#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1088#false} is VALID [2022-02-20 14:24:34,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {1088#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; {1088#false} is VALID [2022-02-20 14:24:34,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {1088#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1088#false} is VALID [2022-02-20 14:24:34,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1088#false} is VALID [2022-02-20 14:24:34,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {1088#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1088#false} is VALID [2022-02-20 14:24:34,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {1088#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1088#false} is VALID [2022-02-20 14:24:34,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {1088#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 == ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1088#false} is VALID [2022-02-20 14:24:34,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {1088#false} assume 0 == __VERIFIER_assert_~cond#1; {1088#false} is VALID [2022-02-20 14:24:34,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2022-02-20 14:24:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:24:34,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:34,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2022-02-20 14:24:34,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {1088#false} assume 0 == __VERIFIER_assert_~cond#1; {1088#false} is VALID [2022-02-20 14:24:34,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {1088#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 == ~ARR_SIZE~0 * (~ARR_SIZE~0 - 1) * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1088#false} is VALID [2022-02-20 14:24:34,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {1088#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1088#false} is VALID [2022-02-20 14:24:34,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {1088#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1088#false} is VALID [2022-02-20 14:24:34,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1088#false} is VALID [2022-02-20 14:24:34,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {1088#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1088#false} is VALID [2022-02-20 14:24:34,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {1088#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; {1088#false} is VALID [2022-02-20 14:24:34,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {1088#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1088#false} is VALID [2022-02-20 14:24:34,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {1088#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; {1088#false} is VALID [2022-02-20 14:24:34,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {1088#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1088#false} is VALID [2022-02-20 14:24:34,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {1088#false} main_~row~0#1 := 0; {1088#false} is VALID [2022-02-20 14:24:34,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {1208#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1088#false} is VALID [2022-02-20 14:24:34,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {1212#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1208#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:34,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {1212#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1212#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:34,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {1212#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1212#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:34,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {1212#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(main_~row~0#1 == main_~column~0#1);call write~int(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); {1212#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:34,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {1225#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1212#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:34,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1225#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:34,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {1229#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} 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_~row~0#1, 4); {1229#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:34,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1229#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:34,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {1101#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1229#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:34,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {1087#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_~sum~0#1 := 0;main_~row~0#1 := 0; {1101#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:24:34,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {1087#true} assume !(0 == assume_abort_if_not_~cond#1); {1087#true} is VALID [2022-02-20 14:24:34,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {1087#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_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1087#true} is VALID [2022-02-20 14:24:34,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {1087#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; {1087#true} is VALID [2022-02-20 14:24:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:24:34,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:34,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843542604] [2022-02-20 14:24:34,259 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:34,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687758264] [2022-02-20 14:24:34,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687758264] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:24:34,259 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:24:34,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-02-20 14:24:34,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220221782] [2022-02-20 14:24:34,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:24:34,260 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) Word has length 26 [2022-02-20 14:24:34,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:34,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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:34,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:34,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:24:34,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:34,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:24:34,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:24:34,287 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:34,882 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2022-02-20 14:24:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 14:24:34,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) Word has length 26 [2022-02-20 14:24:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-02-20 14:24:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-02-20 14:24:34,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-02-20 14:24:34,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:34,980 INFO L225 Difference]: With dead ends: 97 [2022-02-20 14:24:34,980 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:24:34,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2022-02-20 14:24:34,981 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 70 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:34,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 33 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:24:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:24:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2022-02-20 14:24:35,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:35,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 45 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 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:35,048 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 45 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 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:35,049 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 45 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 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:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:35,051 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-02-20 14:24:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-02-20 14:24:35,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:35,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:35,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 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 75 states. [2022-02-20 14:24:35,052 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 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 75 states. [2022-02-20 14:24:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:35,054 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-02-20 14:24:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-02-20 14:24:35,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:35,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:35,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:35,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 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:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-02-20 14:24:35,056 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 26 [2022-02-20 14:24:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:35,057 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-02-20 14:24:35,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-02-20 14:24:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 14:24:35,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:35,058 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:35,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:24:35,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:35,280 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1156561688, now seen corresponding path program 2 times [2022-02-20 14:24:35,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:35,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57467171] [2022-02-20 14:24:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:35,302 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:35,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984292373] [2022-02-20 14:24:35,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:24:35,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:35,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:35,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:24:35,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 14:24:35,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:24:35,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:24:35,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-20 14:24:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:35,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:35,646 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 61 treesize of output 56 [2022-02-20 14:24:35,655 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 19 treesize of output 18 [2022-02-20 14:24:35,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 14:24:35,817 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 81 treesize of output 74 [2022-02-20 14:24:35,845 INFO L356 Elim1Store]: treesize reduction 173, result has 9.4 percent of original size [2022-02-20 14:24:35,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 141 [2022-02-20 14:24:35,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:24:35,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:24:35,887 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 0 case distinctions, treesize of input 78 treesize of output 3 [2022-02-20 14:24:36,256 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 98 treesize of output 89 [2022-02-20 14:24:36,299 INFO L356 Elim1Store]: treesize reduction 378, result has 9.6 percent of original size [2022-02-20 14:24:36,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 147 [2022-02-20 14:24:36,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:36,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 3 [2022-02-20 14:24:36,535 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 80 treesize of output 69 [2022-02-20 14:24:36,603 INFO L356 Elim1Store]: treesize reduction 279, result has 7.9 percent of original size [2022-02-20 14:24:36,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 122 [2022-02-20 14:24:36,625 WARN L234 Elim1Store]: Array PQE input equivalent to false