./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-fpi/s4if.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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 02:12:38,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 02:12:38,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 02:12:38,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 02:12:38,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 02:12:38,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 02:12:38,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 02:12:38,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 02:12:38,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 02:12:38,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 02:12:38,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 02:12:38,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 02:12:38,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 02:12:38,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 02:12:38,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 02:12:38,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 02:12:38,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 02:12:38,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 02:12:38,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 02:12:38,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 02:12:38,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 02:12:38,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 02:12:38,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 02:12:38,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 02:12:38,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 02:12:38,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 02:12:38,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 02:12:38,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 02:12:38,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 02:12:38,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 02:12:38,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 02:12:38,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 02:12:38,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 02:12:38,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 02:12:38,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 02:12:38,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 02:12:38,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 02:12:38,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 02:12:38,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 02:12:38,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 02:12:38,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 02:12:38,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 02:12:38,585 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 02:12:38,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 02:12:38,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 02:12:38,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 02:12:38,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 02:12:38,587 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 02:12:38,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 02:12:38,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 02:12:38,588 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 02:12:38,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 02:12:38,589 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 02:12:38,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 02:12:38,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 02:12:38,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 02:12:38,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 02:12:38,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 02:12:38,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 02:12:38,590 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 02:12:38,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 02:12:38,590 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 02:12:38,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 02:12:38,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 02:12:38,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 02:12:38,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 02:12:38,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:12:38,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 02:12:38,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 02:12:38,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 02:12:38,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 02:12:38,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 02:12:38,593 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 02:12:38,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 02:12:38,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 02:12:38,593 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 02:12:38,594 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2021-12-17 02:12:38,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:12:38,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:12:38,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:12:38,781 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:12:38,781 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:12:38,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2021-12-17 02:12:38,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3861a46c/d49dea3b6a8a45f1a1b5019be8358ac0/FLAGe17d7c56b [2021-12-17 02:12:39,190 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:12:39,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2021-12-17 02:12:39,194 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3861a46c/d49dea3b6a8a45f1a1b5019be8358ac0/FLAGe17d7c56b [2021-12-17 02:12:39,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3861a46c/d49dea3b6a8a45f1a1b5019be8358ac0 [2021-12-17 02:12:39,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:12:39,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:12:39,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:12:39,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:12:39,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:12:39,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d46543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39, skipping insertion in model container [2021-12-17 02:12:39,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:12:39,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:12:39,354 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-fpi/s4if.c[587,600] [2021-12-17 02:12:39,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:12:39,370 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:12:39,378 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-fpi/s4if.c[587,600] [2021-12-17 02:12:39,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:12:39,390 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:12:39,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39 WrapperNode [2021-12-17 02:12:39,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:12:39,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:12:39,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:12:39,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:12:39,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,412 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2021-12-17 02:12:39,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:12:39,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:12:39,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:12:39,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:12:39,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:12:39,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:12:39,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:12:39,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:12:39,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (1/1) ... [2021-12-17 02:12:39,448 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:12:39,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:39,467 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) [2021-12-17 02:12:39,473 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 [2021-12-17 02:12:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:12:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 02:12:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 02:12:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 02:12:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 02:12:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:12:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:12:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 02:12:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 02:12:39,540 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:12:39,541 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:12:39,620 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:12:39,624 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:12:39,624 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 02:12:39,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:39 BoogieIcfgContainer [2021-12-17 02:12:39,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:12:39,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:12:39,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:12:39,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:12:39,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:12:39" (1/3) ... [2021-12-17 02:12:39,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cfe59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:12:39, skipping insertion in model container [2021-12-17 02:12:39,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:12:39" (2/3) ... [2021-12-17 02:12:39,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cfe59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:12:39, skipping insertion in model container [2021-12-17 02:12:39,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:39" (3/3) ... [2021-12-17 02:12:39,631 INFO L111 eAbstractionObserver]: Analyzing ICFG s4if.c [2021-12-17 02:12:39,634 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:12:39,634 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:12:39,661 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:12:39,665 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 [2021-12-17 02:12:39,665 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:12:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) [2021-12-17 02:12:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 02:12:39,676 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:39,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:39,677 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-12-17 02:12:39,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:39,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882873642] [2021-12-17 02:12:39,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:39,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:39,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:39,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882873642] [2021-12-17 02:12:39,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882873642] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:12:39,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:12:39,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 02:12:39,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699392422] [2021-12-17 02:12:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:12:39,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 02:12:39,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:39,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 02:12:39,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 02:12:39,824 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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 has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:39,835 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-12-17 02:12:39,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 02:12:39,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-17 02:12:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:39,842 INFO L225 Difference]: With dead ends: 34 [2021-12-17 02:12:39,843 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 02:12:39,845 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 [2021-12-17 02:12:39,848 INFO L933 BasicCegarLoop]: 22 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, 22 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 [2021-12-17 02:12:39,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:12:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 02:12:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-17 02:12:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-17 02:12:39,884 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-12-17 02:12:39,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:39,885 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-17 02:12:39,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-17 02:12:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 02:12:39,885 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:39,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:39,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 02:12:39,886 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-12-17 02:12:39,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:39,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957757285] [2021-12-17 02:12:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:39,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:39,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:39,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957757285] [2021-12-17 02:12:39,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957757285] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:12:39,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:12:39,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:12:39,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984701813] [2021-12-17 02:12:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:12:39,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:12:39,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:39,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:12:39,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:12:39,985 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:40,046 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-17 02:12:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 02:12:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-17 02:12:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:40,047 INFO L225 Difference]: With dead ends: 28 [2021-12-17 02:12:40,047 INFO L226 Difference]: Without dead ends: 20 [2021-12-17 02:12:40,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:12:40,048 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:40,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:12:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-17 02:12:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2021-12-17 02:12:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-17 02:12:40,052 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-12-17 02:12:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:40,053 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-17 02:12:40,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-12-17 02:12:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 02:12:40,054 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:40,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:40,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 02:12:40,054 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-12-17 02:12:40,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:40,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76686635] [2021-12-17 02:12:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:40,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:40,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:40,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76686635] [2021-12-17 02:12:40,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76686635] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:12:40,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192598067] [2021-12-17 02:12:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:40,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:40,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:40,396 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) [2021-12-17 02:12:40,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 02:12:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:40,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-17 02:12:40,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:40,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-17 02:12:40,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:12:40,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:12:40,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-17 02:12:40,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23 [2021-12-17 02:12:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:40,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:41,039 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:12:41,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-17 02:12:41,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:12:41,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-12-17 02:12:41,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-17 02:12:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:41,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192598067] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:41,063 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:12:41,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2021-12-17 02:12:41,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491023976] [2021-12-17 02:12:41,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:41,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 02:12:41,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 02:12:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-12-17 02:12:41,065 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:41,280 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2021-12-17 02:12:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 02:12:41,280 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 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 [2021-12-17 02:12:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:41,282 INFO L225 Difference]: With dead ends: 46 [2021-12-17 02:12:41,282 INFO L226 Difference]: Without dead ends: 41 [2021-12-17 02:12:41,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2021-12-17 02:12:41,283 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:41,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 44 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 98 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2021-12-17 02:12:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-17 02:12:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2021-12-17 02:12:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 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) [2021-12-17 02:12:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-17 02:12:41,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 16 [2021-12-17 02:12:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:41,288 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-17 02:12:41,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-17 02:12:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 02:12:41,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:41,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:41,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:41,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:41,508 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:41,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2021-12-17 02:12:41,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:41,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004306223] [2021-12-17 02:12:41,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:41,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:41,520 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:12:41,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781591363] [2021-12-17 02:12:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:41,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:41,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:41,526 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) [2021-12-17 02:12:41,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 02:12:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:41,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 02:12:41,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:41,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-17 02:12:41,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 02:12:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:41,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:41,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-17 02:12:41,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-17 02:12:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:41,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:41,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004306223] [2021-12-17 02:12:41,741 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:12:41,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781591363] [2021-12-17 02:12:41,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781591363] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:41,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:12:41,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-17 02:12:41,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287409559] [2021-12-17 02:12:41,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:41,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 02:12:41,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:41,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 02:12:41,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:12:41,743 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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) [2021-12-17 02:12:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:41,787 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2021-12-17 02:12:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:12:41,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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) Word has length 16 [2021-12-17 02:12:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:41,788 INFO L225 Difference]: With dead ends: 38 [2021-12-17 02:12:41,788 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 02:12:41,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-17 02:12:41,790 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:41,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:12:41,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 02:12:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-17 02:12:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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) [2021-12-17 02:12:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-17 02:12:41,794 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-12-17 02:12:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:41,794 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-17 02:12:41,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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) [2021-12-17 02:12:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-17 02:12:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 02:12:41,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:41,795 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:41,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:42,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 02:12:42,014 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2021-12-17 02:12:42,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:42,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199913601] [2021-12-17 02:12:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:42,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:42,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:42,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199913601] [2021-12-17 02:12:42,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199913601] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:12:42,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290184304] [2021-12-17 02:12:42,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:12:42,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:42,088 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) [2021-12-17 02:12:42,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 02:12:42,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:12:42,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:12:42,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:12:42,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:42,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:42,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290184304] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:42,223 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:12:42,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 02:12:42,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804280232] [2021-12-17 02:12:42,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:42,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 02:12:42,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:42,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 02:12:42,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 02:12:42,225 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:42,325 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-17 02:12:42,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:12:42,325 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-17 02:12:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:42,327 INFO L225 Difference]: With dead ends: 33 [2021-12-17 02:12:42,327 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 02:12:42,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-17 02:12:42,328 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:42,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:12:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 02:12:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2021-12-17 02:12:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 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) [2021-12-17 02:12:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-17 02:12:42,332 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2021-12-17 02:12:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:42,332 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-17 02:12:42,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-17 02:12:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 02:12:42,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:42,333 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:42,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:42,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:42,533 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:42,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2021-12-17 02:12:42,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:42,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505502040] [2021-12-17 02:12:42,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:42,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:42,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:42,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505502040] [2021-12-17 02:12:42,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505502040] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:12:42,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555894121] [2021-12-17 02:12:42,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:12:42,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:42,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:42,591 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) [2021-12-17 02:12:42,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 02:12:42,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 02:12:42,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:12:42,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:12:42,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:42,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:42,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555894121] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:42,710 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:12:42,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 02:12:42,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018328088] [2021-12-17 02:12:42,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:42,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 02:12:42,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 02:12:42,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 02:12:42,711 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:42,763 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-17 02:12:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:12:42,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-17 02:12:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:42,764 INFO L225 Difference]: With dead ends: 37 [2021-12-17 02:12:42,765 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 02:12:42,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-17 02:12:42,765 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:42,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 21 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:12:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 02:12:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-17 02:12:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) [2021-12-17 02:12:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-17 02:12:42,768 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-12-17 02:12:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:42,768 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-17 02:12:42,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-17 02:12:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 02:12:42,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:42,769 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:42,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:42,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:42,983 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:42,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2021-12-17 02:12:42,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:42,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408321962] [2021-12-17 02:12:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:42,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:43,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:43,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408321962] [2021-12-17 02:12:43,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408321962] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:12:43,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478097499] [2021-12-17 02:12:43,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:12:43,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:43,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:43,226 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) [2021-12-17 02:12:43,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 02:12:43,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:12:43,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:12:43,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-17 02:12:43,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:43,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-17 02:12:43,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:43,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:12:43,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:43,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:12:43,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:43,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-17 02:12:43,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:43,545 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:12:43,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-17 02:12:43,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:43,684 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:12:43,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2021-12-17 02:12:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:43,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:46,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_153 (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (let ((.cse2 (* .cse5 (- 1))) (.cse3 (* .cse0 (- 1))) (.cse4 (* .cse1 (- 1)))) (and (<= (div (+ .cse2 .cse3 .cse4) (- 4)) (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 2) (div (+ .cse2 .cse3 .cse4 (- 1)) (- 4))))))))))) is different from false [2021-12-17 02:12:46,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_153 (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (let ((.cse1 (* .cse5 (- 1))) (.cse2 (* .cse0 (- 1))) (.cse3 (* .cse4 (- 1)))) (and (<= (div (+ .cse1 .cse2 .cse3) (- 4)) (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 3) (div (+ .cse1 .cse2 .cse3 (- 1)) (- 4))))) (not (= 4 .cse4)))))))) is different from false [2021-12-17 02:12:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-17 02:12:46,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478097499] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:46,392 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:12:46,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2021-12-17 02:12:46,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449951186] [2021-12-17 02:12:46,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:46,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-17 02:12:46,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:46,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-17 02:12:46,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=753, Unknown=3, NotChecked=114, Total=992 [2021-12-17 02:12:46,395 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:46,605 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-17 02:12:46,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 02:12:46,606 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 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 [2021-12-17 02:12:46,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:46,607 INFO L225 Difference]: With dead ends: 36 [2021-12-17 02:12:46,607 INFO L226 Difference]: Without dead ends: 32 [2021-12-17 02:12:46,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=177, Invalid=950, Unknown=3, NotChecked=130, Total=1260 [2021-12-17 02:12:46,608 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:46,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2021-12-17 02:12:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-17 02:12:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-12-17 02:12:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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) [2021-12-17 02:12:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-17 02:12:46,611 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2021-12-17 02:12:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:46,611 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-17 02:12:46,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-17 02:12:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 02:12:46,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:46,612 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:46,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:46,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:46,816 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2021-12-17 02:12:46,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:46,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011648311] [2021-12-17 02:12:46,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:46,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:46,824 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:12:46,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450503787] [2021-12-17 02:12:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:46,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:46,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:46,825 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) [2021-12-17 02:12:46,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 02:12:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:46,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-17 02:12:46,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:46,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-17 02:12:46,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:46,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-17 02:12:47,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 02:12:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:47,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:47,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-17 02:12:47,087 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-17 02:12:47,096 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:12:47,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-17 02:12:47,101 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:12:47,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-17 02:12:47,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:12:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-17 02:12:47,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:47,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011648311] [2021-12-17 02:12:47,148 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:12:47,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450503787] [2021-12-17 02:12:47,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450503787] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:47,149 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:12:47,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-17 02:12:47,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370432211] [2021-12-17 02:12:47,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:47,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 02:12:47,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:47,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 02:12:47,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2021-12-17 02:12:47,150 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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) [2021-12-17 02:12:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:47,279 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-12-17 02:12:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 02:12:47,280 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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) Word has length 21 [2021-12-17 02:12:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:47,280 INFO L225 Difference]: With dead ends: 41 [2021-12-17 02:12:47,280 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 02:12:47,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=238, Unknown=2, NotChecked=66, Total=380 [2021-12-17 02:12:47,281 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:47,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 121 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2021-12-17 02:12:47,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 02:12:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-17 02:12:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-12-17 02:12:47,285 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2021-12-17 02:12:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:47,285 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-17 02:12:47,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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) [2021-12-17 02:12:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-12-17 02:12:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 02:12:47,286 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:47,286 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:47,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:47,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:47,501 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:47,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2021-12-17 02:12:47,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:47,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714206900] [2021-12-17 02:12:47,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:47,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:47,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:47,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714206900] [2021-12-17 02:12:47,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714206900] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:12:47,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582766562] [2021-12-17 02:12:47,569 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:12:47,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:47,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:47,571 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:12:47,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 02:12:47,617 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-17 02:12:47,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:12:47,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:12:47,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:47,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:47,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582766562] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:47,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:12:47,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 02:12:47,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144756780] [2021-12-17 02:12:47,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:47,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 02:12:47,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:47,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 02:12:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:12:47,761 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:47,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:47,882 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-12-17 02:12:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 02:12:47,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-17 02:12:47,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:47,883 INFO L225 Difference]: With dead ends: 41 [2021-12-17 02:12:47,883 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 02:12:47,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-17 02:12:47,884 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:47,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 28 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:12:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 02:12:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2021-12-17 02:12:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-17 02:12:47,887 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2021-12-17 02:12:47,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:47,887 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-17 02:12:47,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:47,887 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-17 02:12:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 02:12:47,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:47,887 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:47,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:48,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:48,095 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:48,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2021-12-17 02:12:48,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:48,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736884542] [2021-12-17 02:12:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:48,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:48,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:48,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736884542] [2021-12-17 02:12:48,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736884542] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:12:48,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669070727] [2021-12-17 02:12:48,160 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:12:48,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:48,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:48,162 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:12:48,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 02:12:48,217 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-17 02:12:48,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:12:48,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:12:48,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:48,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:48,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669070727] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:48,329 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:12:48,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 02:12:48,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218486742] [2021-12-17 02:12:48,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:48,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 02:12:48,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:48,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 02:12:48,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:12:48,336 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:48,412 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-12-17 02:12:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 02:12:48,413 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 24 [2021-12-17 02:12:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:48,413 INFO L225 Difference]: With dead ends: 45 [2021-12-17 02:12:48,413 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 02:12:48,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:12:48,414 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:48,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 21 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:12:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 02:12:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-17 02:12:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-17 02:12:48,417 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-17 02:12:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:48,417 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-17 02:12:48,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-17 02:12:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 02:12:48,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:48,418 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:48,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:48,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 02:12:48,631 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:48,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:48,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2021-12-17 02:12:48,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:48,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813894014] [2021-12-17 02:12:48,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:48,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:49,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:49,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813894014] [2021-12-17 02:12:49,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813894014] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:12:49,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312908922] [2021-12-17 02:12:49,113 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 02:12:49,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:49,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:49,114 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:12:49,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 02:12:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:49,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-17 02:12:49,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:49,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-17 02:12:49,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-17 02:12:49,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:12:49,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:12:49,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:12:49,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-17 02:12:49,489 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:12:49,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-17 02:12:49,579 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:12:49,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-17 02:12:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:49,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:54,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse1 .cse0 .cse2 .cse3) (* 4 ~N~0)) (not (= 4 .cse2))))))))) (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))) is different from false [2021-12-17 02:12:54,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (= (+ .cse1 .cse0 .cse2 .cse3) (* 4 ~N~0)) (not (= 4 .cse2))))))))) is different from false [2021-12-17 02:12:54,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse0 .cse1 .cse2 .cse3) (* 4 ~N~0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse2))))))))) is different from false [2021-12-17 02:12:54,489 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (+ .cse0 .cse1 .cse2 .cse3) (* 4 ~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse2))))))))) is different from false [2021-12-17 02:12:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-17 02:12:54,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312908922] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:54,631 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:12:54,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 42 [2021-12-17 02:12:54,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780734119] [2021-12-17 02:12:54,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:54,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-17 02:12:54,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:54,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-17 02:12:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1266, Unknown=6, NotChecked=300, Total=1722 [2021-12-17 02:12:54,633 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:54,933 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2021-12-17 02:12:54,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 02:12:54,934 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 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 [2021-12-17 02:12:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:54,934 INFO L225 Difference]: With dead ends: 45 [2021-12-17 02:12:54,934 INFO L226 Difference]: Without dead ends: 41 [2021-12-17 02:12:54,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=203, Invalid=1529, Unknown=6, NotChecked=332, Total=2070 [2021-12-17 02:12:54,935 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:54,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 116 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 242 Invalid, 0 Unknown, 199 Unchecked, 0.1s Time] [2021-12-17 02:12:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-17 02:12:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-12-17 02:12:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-17 02:12:54,939 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2021-12-17 02:12:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:54,939 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-17 02:12:54,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-17 02:12:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 02:12:54,940 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:54,940 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:54,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:55,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:55,148 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:55,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2021-12-17 02:12:55,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:55,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522620015] [2021-12-17 02:12:55,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:55,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:55,164 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:12:55,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012139001] [2021-12-17 02:12:55,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:12:55,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:55,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:55,174 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:12:55,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 02:12:55,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:12:55,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:12:55,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 02:12:55,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:55,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-17 02:12:55,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:55,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-17 02:12:55,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:55,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-17 02:12:55,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-17 02:12:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:55,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:55,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-17 02:12:55,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)) is different from false [2021-12-17 02:12:55,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)) is different from false [2021-12-17 02:12:55,445 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:12:55,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-17 02:12:55,451 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:12:55,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-17 02:12:55,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:12:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-17 02:12:55,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:55,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522620015] [2021-12-17 02:12:55,518 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:12:55,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012139001] [2021-12-17 02:12:55,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012139001] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:55,518 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:12:55,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-17 02:12:55,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885572336] [2021-12-17 02:12:55,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:55,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-17 02:12:55,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:55,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-17 02:12:55,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2021-12-17 02:12:55,519 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:55,696 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-12-17 02:12:55,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 02:12:55,697 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 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 [2021-12-17 02:12:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:55,697 INFO L225 Difference]: With dead ends: 49 [2021-12-17 02:12:55,697 INFO L226 Difference]: Without dead ends: 42 [2021-12-17 02:12:55,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=380, Unknown=3, NotChecked=126, Total=600 [2021-12-17 02:12:55,698 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:55,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 54 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 151 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2021-12-17 02:12:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-17 02:12:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-17 02:12:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-12-17 02:12:55,702 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2021-12-17 02:12:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:55,702 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-12-17 02:12:55,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-12-17 02:12:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 02:12:55,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:55,702 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:55,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:55,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 02:12:55,908 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:55,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2021-12-17 02:12:55,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:55,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299420607] [2021-12-17 02:12:55,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:55,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:55,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:55,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299420607] [2021-12-17 02:12:55,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299420607] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:12:55,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48112537] [2021-12-17 02:12:55,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:12:55,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:55,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:55,992 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:12:55,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 02:12:56,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:12:56,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:12:56,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 02:12:56,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:56,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:56,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48112537] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:56,209 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:12:56,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 02:12:56,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546190846] [2021-12-17 02:12:56,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:56,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 02:12:56,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:56,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 02:12:56,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:12:56,211 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:56,372 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-12-17 02:12:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 02:12:56,372 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 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 28 [2021-12-17 02:12:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:56,373 INFO L225 Difference]: With dead ends: 49 [2021-12-17 02:12:56,373 INFO L226 Difference]: Without dead ends: 45 [2021-12-17 02:12:56,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-17 02:12:56,373 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:56,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 22 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:12:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-17 02:12:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2021-12-17 02:12:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 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) [2021-12-17 02:12:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-17 02:12:56,376 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2021-12-17 02:12:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:56,377 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-17 02:12:56,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-17 02:12:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 02:12:56,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:56,377 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:56,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:56,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 02:12:56,578 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2021-12-17 02:12:56,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:56,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843574677] [2021-12-17 02:12:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:56,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:56,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:56,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843574677] [2021-12-17 02:12:56,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843574677] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:12:56,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387699975] [2021-12-17 02:12:56,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:12:56,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:56,637 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:12:56,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 02:12:56,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-17 02:12:56,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:12:56,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 02:12:56,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:56,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:12:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:56,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387699975] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:12:56,847 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:12:56,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 02:12:56,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947893056] [2021-12-17 02:12:56,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:12:56,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 02:12:56,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:12:56,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 02:12:56,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:12:56,849 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:12:56,942 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-12-17 02:12:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 02:12:56,943 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 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 29 [2021-12-17 02:12:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:12:56,943 INFO L225 Difference]: With dead ends: 53 [2021-12-17 02:12:56,943 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 02:12:56,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-17 02:12:56,944 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:12:56,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 37 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:12:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 02:12:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-12-17 02:12:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 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) [2021-12-17 02:12:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-17 02:12:56,947 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2021-12-17 02:12:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:12:56,947 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-17 02:12:56,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:12:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-17 02:12:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 02:12:56,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:12:56,947 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:12:56,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 02:12:57,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-17 02:12:57,159 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:12:57,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:12:57,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2021-12-17 02:12:57,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:12:57,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973816278] [2021-12-17 02:12:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:12:57,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:12:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:12:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:57,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:12:57,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973816278] [2021-12-17 02:12:57,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973816278] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:12:57,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706110335] [2021-12-17 02:12:57,615 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:12:57,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:12:57,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:12:57,616 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:12:57,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 02:12:57,667 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:12:57,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:12:57,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-17 02:12:57,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:12:57,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-17 02:12:57,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:57,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:12:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:57,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:12:57,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:57,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:12:57,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:57,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:12:58,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:58,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-17 02:12:58,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:58,149 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:12:58,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-17 02:12:58,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:58,292 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:12:58,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-17 02:12:58,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:58,422 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:12:58,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-17 02:12:58,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:12:58,592 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:12:58,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2021-12-17 02:12:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:12:58,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:13:15,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse0 .cse2 .cse3 .cse1 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (not (= 4 .cse3)))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))) is different from false [2021-12-17 02:13:15,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse0 .cse2 .cse3 .cse1 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse3)))))))))) is different from false [2021-12-17 02:13:15,914 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse1 .cse2 .cse3 .cse0 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse3)))))))))) is different from false [2021-12-17 02:13:16,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse1 .cse2 .cse3 .cse0 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse3)))))))))) is different from false [2021-12-17 02:13:16,716 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse0)) (not (= 4 .cse1)) (not (= 4 .cse2)) (= (+ .cse1 .cse2 .cse3 .cse0 .cse4) (* 4 ~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse3)))))))))) is different from false [2021-12-17 02:13:17,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 4 .cse0)) (not (= 4 .cse1)) (not (= 4 .cse2)) (= (+ .cse1 .cse2 .cse3 .cse0 .cse4) (* 4 ~N~0)) (not (= 4 .cse3)))))))))) is different from false [2021-12-17 02:13:17,533 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse1 .cse2 .cse3 .cse0 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (not (= 4 .cse3)))))))))) is different from false [2021-12-17 02:13:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-12-17 02:13:17,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706110335] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:13:17,559 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:13:17,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 21] total 55 [2021-12-17 02:13:17,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267344563] [2021-12-17 02:13:17,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:13:17,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-17 02:13:17,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:13:17,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-17 02:13:17,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2085, Unknown=13, NotChecked=686, Total=2970 [2021-12-17 02:13:17,561 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 55 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 55 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:13:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:13:18,271 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-17 02:13:18,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 02:13:18,272 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 55 states have internal predecessors, (80), 0 states have call successors, (0), 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 31 [2021-12-17 02:13:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:13:18,272 INFO L225 Difference]: With dead ends: 53 [2021-12-17 02:13:18,272 INFO L226 Difference]: Without dead ends: 49 [2021-12-17 02:13:18,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=228, Invalid=2337, Unknown=13, NotChecked=728, Total=3306 [2021-12-17 02:13:18,275 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:13:18,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 179 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 305 Unchecked, 0.2s Time] [2021-12-17 02:13:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-17 02:13:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2021-12-17 02:13:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:13:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-12-17 02:13:18,281 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2021-12-17 02:13:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:13:18,281 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-17 02:13:18,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 55 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:13:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-12-17 02:13:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 02:13:18,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:13:18,282 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:13:18,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-17 02:13:18,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 02:13:18,495 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:13:18,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:13:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2021-12-17 02:13:18,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:13:18,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132581549] [2021-12-17 02:13:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:13:18,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:13:18,503 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:13:18,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314194918] [2021-12-17 02:13:18,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:13:18,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:13:18,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:13:18,504 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:13:18,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-17 02:13:18,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-17 02:13:18,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:13:18,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-17 02:13:18,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:13:18,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-17 02:13:18,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 02:13:18,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 20 [2021-12-17 02:13:18,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 20 [2021-12-17 02:13:18,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 20 [2021-12-17 02:13:18,780 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:13:18,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-12-17 02:13:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 02:13:18,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:13:18,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int)) (or (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= c_~N~0 |ULTIMATE.start_main_~i~0#1|) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) is different from false [2021-12-17 02:13:19,020 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:13:19,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-17 02:13:19,026 INFO L354 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-17 02:13:19,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2021-12-17 02:13:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2021-12-17 02:13:19,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:13:19,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132581549] [2021-12-17 02:13:19,041 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:13:19,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314194918] [2021-12-17 02:13:19,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314194918] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:13:19,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:13:19,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-12-17 02:13:19,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121907989] [2021-12-17 02:13:19,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:13:19,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 02:13:19,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:13:19,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 02:13:19,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=6, NotChecked=24, Total=210 [2021-12-17 02:13:19,042 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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) [2021-12-17 02:13:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:13:23,132 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-12-17 02:13:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:13:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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 31 [2021-12-17 02:13:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:13:23,132 INFO L225 Difference]: With dead ends: 56 [2021-12-17 02:13:23,132 INFO L226 Difference]: Without dead ends: 52 [2021-12-17 02:13:23,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=73, Invalid=165, Unknown=6, NotChecked=28, Total=272 [2021-12-17 02:13:23,133 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:13:23,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 35 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2021-12-17 02:13:23,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-17 02:13:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-12-17 02:13:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:13:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-12-17 02:13:23,138 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2021-12-17 02:13:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:13:23,138 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-12-17 02:13:23,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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) [2021-12-17 02:13:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-12-17 02:13:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-17 02:13:23,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:13:23,139 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:13:23,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-17 02:13:23,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:13:23,356 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:13:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:13:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2021-12-17 02:13:23,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:13:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899678917] [2021-12-17 02:13:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:13:23,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:13:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:13:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:13:23,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:13:23,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899678917] [2021-12-17 02:13:23,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899678917] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:13:23,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439343712] [2021-12-17 02:13:23,456 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:13:23,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:13:23,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:13:23,457 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:13:23,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-17 02:13:23,531 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-17 02:13:23,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:13:23,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 02:13:23,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:13:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:13:23,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:13:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:13:23,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439343712] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:13:23,721 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:13:23,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-17 02:13:23,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756776719] [2021-12-17 02:13:23,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:13:23,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 02:13:23,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:13:23,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 02:13:23,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-17 02:13:23,722 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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) [2021-12-17 02:13:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:13:23,986 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2021-12-17 02:13:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 02:13:23,987 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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) Word has length 33 [2021-12-17 02:13:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:13:23,987 INFO L225 Difference]: With dead ends: 69 [2021-12-17 02:13:23,987 INFO L226 Difference]: Without dead ends: 65 [2021-12-17 02:13:23,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2021-12-17 02:13:23,988 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:13:23,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 34 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:13:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-17 02:13:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2021-12-17 02:13:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:13:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-17 02:13:23,991 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2021-12-17 02:13:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:13:23,992 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-17 02:13:23,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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) [2021-12-17 02:13:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2021-12-17 02:13:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 02:13:23,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:13:23,992 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:13:24,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-17 02:13:24,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-17 02:13:24,209 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:13:24,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:13:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2021-12-17 02:13:24,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:13:24,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416862984] [2021-12-17 02:13:24,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:13:24,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:13:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:13:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:13:24,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:13:24,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416862984] [2021-12-17 02:13:24,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416862984] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:13:24,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456964278] [2021-12-17 02:13:24,324 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:13:24,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:13:24,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:13:24,325 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:13:24,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-17 02:13:24,394 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-17 02:13:24,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:13:24,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 02:13:24,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:13:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:13:24,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:13:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:13:24,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456964278] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:13:24,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:13:24,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-17 02:13:24,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268848584] [2021-12-17 02:13:24,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:13:24,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 02:13:24,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:13:24,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 02:13:24,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-17 02:13:24,592 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:13:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:13:24,719 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2021-12-17 02:13:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 02:13:24,720 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 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 34 [2021-12-17 02:13:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:13:24,720 INFO L225 Difference]: With dead ends: 78 [2021-12-17 02:13:24,720 INFO L226 Difference]: Without dead ends: 50 [2021-12-17 02:13:24,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-12-17 02:13:24,721 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:13:24,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 29 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:13:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-17 02:13:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-12-17 02:13:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:13:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-12-17 02:13:24,724 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2021-12-17 02:13:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:13:24,724 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-12-17 02:13:24,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:13:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2021-12-17 02:13:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 02:13:24,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:13:24,725 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:13:24,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-17 02:13:24,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-17 02:13:24,941 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:13:24,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:13:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2021-12-17 02:13:24,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:13:24,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403139194] [2021-12-17 02:13:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:13:24,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:13:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:13:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:13:25,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:13:25,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403139194] [2021-12-17 02:13:25,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403139194] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:13:25,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357141556] [2021-12-17 02:13:25,553 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 02:13:25,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:13:25,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:13:25,554 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:13:25,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-17 02:13:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:13:25,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-17 02:13:25,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:13:25,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-17 02:13:25,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-17 02:13:25,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:13:25,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:13:25,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:13:25,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:13:25,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:13:25,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-17 02:13:25,998 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:13:25,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-17 02:13:26,150 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 02:13:26,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 59 [2021-12-17 02:13:26,389 INFO L354 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2021-12-17 02:13:26,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 75 [2021-12-17 02:13:26,557 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 02:13:26,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2021-12-17 02:13:26,717 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 02:13:26,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 35 [2021-12-17 02:13:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:13:26,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:14:07,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_228| Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_228| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_225| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_219| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (* 4 ~N~0)) (not (= 4 .cse2)) (not (= 4 .cse4)) (not (= 4 .cse3)) (not (= 4 .cse1))))))))))))) is different from false [2021-12-17 02:14:09,078 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_228| Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_228| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_225| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_219| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (* 4 ~N~0)) (not (= 4 .cse2)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse4)) (not (= 4 .cse3)) (not (= 4 .cse1))))))))))) is different from false [2021-12-17 02:14:11,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_228| Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_228| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_225| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_219| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (* 4 ~N~0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse4)) (not (= 4 .cse3)) (not (= 4 .cse1))))))))))) is different from false [2021-12-17 02:14:12,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_228| Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_228| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_225| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_219| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse0)) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (* 4 ~N~0)) (not (= 4 .cse2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse3)) (not (= 4 .cse4)) (not (= 4 .cse1))))))))))) is different from false [2021-12-17 02:14:14,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_228| Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_228| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_225| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_219| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 4 .cse0)) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (* 4 ~N~0)) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse4)) (not (= 4 .cse1))))))))))) is different from false [2021-12-17 02:14:15,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_228| Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_228| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_225| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0 .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_219| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 4 .cse0)) (not (= 4 .cse1)) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse4)) (= (+ .cse4 .cse0 .cse1 .cse2 .cse5 .cse3) (* 4 ~N~0))))))))))) is different from false [2021-12-17 02:14:16,911 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_228| Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_228| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_225| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0 .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_219| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 5) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse4)) (= (+ .cse4 .cse0 .cse1 .cse2 .cse5 .cse3) (* 4 ~N~0))))))))))) is different from false [2021-12-17 02:14:18,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_709 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_228| Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_709 (+ (* |v_ULTIMATE.start_main_~i~0#1_228| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_225| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse1 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_219| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 5) ~N~0) (not (= 4 .cse2)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (not (= 4 .cse3)) (not (= 4 .cse4)) (= (+ .cse3 .cse0 .cse1 .cse2 .cse5 .cse4) (* 4 ~N~0))))))))))) is different from false [2021-12-17 02:14:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2021-12-17 02:14:18,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357141556] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:14:18,293 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:14:18,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 24] total 60 [2021-12-17 02:14:18,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406631780] [2021-12-17 02:14:18,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:14:18,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-12-17 02:14:18,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:14:18,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-12-17 02:14:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2455, Unknown=25, NotChecked=856, Total=3540 [2021-12-17 02:14:18,295 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 60 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:14:18,856 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2021-12-17 02:14:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 02:14:18,856 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 0 states have call successors, (0), 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 36 [2021-12-17 02:14:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:14:18,857 INFO L225 Difference]: With dead ends: 66 [2021-12-17 02:14:18,857 INFO L226 Difference]: Without dead ends: 62 [2021-12-17 02:14:18,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 38 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=253, Invalid=2834, Unknown=25, NotChecked=920, Total=4032 [2021-12-17 02:14:18,858 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:14:18,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 152 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 264 Invalid, 0 Unknown, 394 Unchecked, 0.1s Time] [2021-12-17 02:14:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-17 02:14:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2021-12-17 02:14:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2021-12-17 02:14:18,863 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 36 [2021-12-17 02:14:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:14:18,871 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2021-12-17 02:14:18,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-12-17 02:14:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 02:14:18,871 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:14:18,871 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:14:18,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-17 02:14:19,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:14:19,080 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:14:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:14:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash 83735393, now seen corresponding path program 4 times [2021-12-17 02:14:19,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:14:19,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456078641] [2021-12-17 02:14:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:14:19,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:14:19,087 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:14:19,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1572603435] [2021-12-17 02:14:19,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:14:19,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:14:19,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:14:19,089 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:14:19,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-17 02:14:19,151 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:14:19,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:14:19,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-17 02:14:19,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:14:19,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2021-12-17 02:14:19,280 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 02:14:19,281 INFO L388 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 02:14:19,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:19,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-17 02:14:19,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:19,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-17 02:14:19,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:19,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-17 02:14:19,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-17 02:14:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:14:19,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:14:19,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-17 02:14:19,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)) is different from false [2021-12-17 02:14:19,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 12)) 4)) is different from false [2021-12-17 02:14:19,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) 4)) is different from false [2021-12-17 02:14:19,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_776 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_776)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) 4)) is different from false [2021-12-17 02:14:19,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_248| Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_776 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_248| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_776)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) 4)) (< |v_ULTIMATE.start_main_~i~0#1_248| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:14:19,602 INFO L354 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2021-12-17 02:14:19,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2021-12-17 02:14:19,607 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:14:19,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-17 02:14:19,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:14:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 31 not checked. [2021-12-17 02:14:19,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:14:19,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456078641] [2021-12-17 02:14:19,704 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:14:19,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572603435] [2021-12-17 02:14:19,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572603435] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:14:19,704 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:14:19,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2021-12-17 02:14:19,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882784471] [2021-12-17 02:14:19,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:14:19,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-17 02:14:19,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:14:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-17 02:14:19,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=364, Unknown=6, NotChecked=258, Total=702 [2021-12-17 02:14:19,705 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:21,798 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= |c_ULTIMATE.start_main_~i~0#1| 3) (forall ((|v_ULTIMATE.start_main_~i~0#1_248| Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_776 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_248| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_776)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) 4)) (< |v_ULTIMATE.start_main_~i~0#1_248| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-12-17 02:14:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:14:22,062 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2021-12-17 02:14:22,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 02:14:22,063 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 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 36 [2021-12-17 02:14:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:14:22,063 INFO L225 Difference]: With dead ends: 69 [2021-12-17 02:14:22,063 INFO L226 Difference]: Without dead ends: 60 [2021-12-17 02:14:22,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=112, Invalid=611, Unknown=7, NotChecked=392, Total=1122 [2021-12-17 02:14:22,064 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:14:22,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 79 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 331 Invalid, 0 Unknown, 195 Unchecked, 0.2s Time] [2021-12-17 02:14:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-17 02:14:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2021-12-17 02:14:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2021-12-17 02:14:22,074 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 36 [2021-12-17 02:14:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:14:22,074 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2021-12-17 02:14:22,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2021-12-17 02:14:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 02:14:22,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:14:22,075 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:14:22,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-17 02:14:22,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:14:22,276 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:14:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:14:22,276 INFO L85 PathProgramCache]: Analyzing trace with hash -746726435, now seen corresponding path program 14 times [2021-12-17 02:14:22,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:14:22,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79282650] [2021-12-17 02:14:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:14:22,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:14:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:14:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:14:22,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:14:22,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79282650] [2021-12-17 02:14:22,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79282650] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:14:22,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354178773] [2021-12-17 02:14:22,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:14:22,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:14:22,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:14:22,399 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:14:22,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-17 02:14:22,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:14:22,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:14:22,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 02:14:22,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:14:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:14:22,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:14:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:14:22,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354178773] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:14:22,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:14:22,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2021-12-17 02:14:22,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177660975] [2021-12-17 02:14:22,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:14:22,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 02:14:22,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:14:22,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 02:14:22,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-12-17 02:14:22,716 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:14:23,012 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2021-12-17 02:14:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 02:14:23,013 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 38 [2021-12-17 02:14:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:14:23,013 INFO L225 Difference]: With dead ends: 77 [2021-12-17 02:14:23,013 INFO L226 Difference]: Without dead ends: 73 [2021-12-17 02:14:23,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2021-12-17 02:14:23,014 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:14:23,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 36 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:14:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-17 02:14:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 45. [2021-12-17 02:14:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2021-12-17 02:14:23,018 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 38 [2021-12-17 02:14:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:14:23,018 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2021-12-17 02:14:23,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2021-12-17 02:14:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 02:14:23,019 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:14:23,019 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:14:23,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-17 02:14:23,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:14:23,238 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:14:23,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:14:23,238 INFO L85 PathProgramCache]: Analyzing trace with hash 465948487, now seen corresponding path program 15 times [2021-12-17 02:14:23,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:14:23,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382192337] [2021-12-17 02:14:23,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:14:23,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:14:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:14:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:14:23,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:14:23,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382192337] [2021-12-17 02:14:23,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382192337] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:14:23,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857142307] [2021-12-17 02:14:23,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:14:23,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:14:23,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:14:23,365 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:14:23,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-17 02:14:23,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-17 02:14:23,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:14:23,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 02:14:23,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:14:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:14:23,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:14:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:14:23,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857142307] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:14:23,696 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:14:23,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2021-12-17 02:14:23,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130563843] [2021-12-17 02:14:23,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:14:23,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 02:14:23,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:14:23,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 02:14:23,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-12-17 02:14:23,697 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:14:23,871 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2021-12-17 02:14:23,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 02:14:23,871 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 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 39 [2021-12-17 02:14:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:14:23,872 INFO L225 Difference]: With dead ends: 86 [2021-12-17 02:14:23,872 INFO L226 Difference]: Without dead ends: 55 [2021-12-17 02:14:23,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2021-12-17 02:14:23,873 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:14:23,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 41 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:14:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-17 02:14:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2021-12-17 02:14:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2021-12-17 02:14:23,877 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 39 [2021-12-17 02:14:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:14:23,877 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2021-12-17 02:14:23,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:14:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2021-12-17 02:14:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 02:14:23,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:14:23,878 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:14:23,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-17 02:14:24,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-17 02:14:24,078 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:14:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:14:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash -552579063, now seen corresponding path program 16 times [2021-12-17 02:14:24,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:14:24,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396289215] [2021-12-17 02:14:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:14:24,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:14:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:14:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:14:24,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:14:24,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396289215] [2021-12-17 02:14:24,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396289215] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:14:24,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503466480] [2021-12-17 02:14:24,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:14:24,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:14:24,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:14:24,760 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:14:24,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-17 02:14:24,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:14:24,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:14:24,831 WARN L261 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-17 02:14:24,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:14:24,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-17 02:14:24,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:24,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:14:24,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:24,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:14:24,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:24,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:14:25,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:25,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:14:25,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:25,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:14:25,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:25,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:14:25,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:25,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-17 02:14:25,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:25,537 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:14:25,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-17 02:14:25,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:25,712 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:14:25,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-17 02:14:25,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:25,880 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:14:25,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-17 02:14:26,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:26,075 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:14:26,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-17 02:14:26,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:26,247 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:14:26,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-17 02:14:26,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:14:26,425 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:14:26,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 30 [2021-12-17 02:14:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:14:26,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:16:01,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int) (v_ArrVal_966 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (|v_ULTIMATE.start_main_~i~0#1_320| Int) (|v_ULTIMATE.start_main_~i~0#1_309| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_966 (+ (* |v_ULTIMATE.start_main_~i~0#1_320| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4 .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_309| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse1) (* 4 ~N~0)) (not (= 4 .cse4)) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse5)))))))))))))) is different from false [2021-12-17 02:16:09,192 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int) (v_ArrVal_966 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_320| Int) (|v_ULTIMATE.start_main_~i~0#1_309| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_966 (+ (* |v_ULTIMATE.start_main_~i~0#1_320| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4 .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_309| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (+ .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse1) (* 4 ~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse4)) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse5)))))))))))) is different from false [2021-12-17 02:16:17,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int) (v_ArrVal_966 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_320| Int) (|v_ULTIMATE.start_main_~i~0#1_309| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_966 (+ (* |v_ULTIMATE.start_main_~i~0#1_320| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse3 .cse4 .cse6 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_309| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (+ .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse0) (* 4 ~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse4)) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse5)))))))))))) is different from false [2021-12-17 02:16:27,636 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int) (v_ArrVal_966 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_320| Int) (|v_ULTIMATE.start_main_~i~0#1_309| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_966 (+ (* |v_ULTIMATE.start_main_~i~0#1_320| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse3 .cse4 .cse6 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_309| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse0)) (not (= 4 .cse1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (= (+ .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse0) (* 4 ~N~0)) (not (= 4 .cse4)) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse5)))))))))))) is different from false [2021-12-17 02:16:36,838 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int) (v_ArrVal_966 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_320| Int) (|v_ULTIMATE.start_main_~i~0#1_309| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select v_ArrVal_966 (+ (* |v_ULTIMATE.start_main_~i~0#1_320| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse5 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_309| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse1)) (not (= 4 .cse2)) (not (= 4 .cse3)) (= (+ .cse4 .cse3 .cse2 .cse5 .cse0 .cse1 .cse6) (* 4 ~N~0)) (not (= 4 .cse5)) (not (= 4 .cse4)))))))))))) is different from false [2021-12-17 02:16:46,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int) (v_ArrVal_966 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_320| Int) (|v_ULTIMATE.start_main_~i~0#1_309| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select v_ArrVal_966 (+ (* |v_ULTIMATE.start_main_~i~0#1_320| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse5 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_309| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 4 .cse0)) (not (= 4 .cse1)) (not (= 4 .cse2)) (not (= 4 .cse3)) (= (+ .cse4 .cse3 .cse2 .cse5 .cse0 .cse1 .cse6) (* 4 ~N~0)) (not (= 4 .cse5)) (not (= 4 .cse4)))))))))))) is different from false [2021-12-17 02:17:06,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int) (v_ArrVal_966 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_320| Int) (|v_ULTIMATE.start_main_~i~0#1_309| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select v_ArrVal_966 (+ (* |v_ULTIMATE.start_main_~i~0#1_320| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2 .cse5 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_309| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 5) ~N~0) (not (= 4 .cse1)) (not (= 4 .cse2)) (not (= 4 .cse3)) (= (+ .cse4 .cse3 .cse2 .cse5 .cse0 .cse1 .cse6) (* 4 ~N~0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (not (= 4 .cse5)) (not (= 4 .cse4)))))))))))) is different from false [2021-12-17 02:17:17,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int) (v_ArrVal_966 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_320| Int) (|v_ULTIMATE.start_main_~i~0#1_309| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_966 (+ (* |v_ULTIMATE.start_main_~i~0#1_320| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse3 .cse4 .cse6 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_309| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 5) ~N~0) (= (+ .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse0) (* 4 ~N~0)) (not (= 4 .cse4)) (not (= 4 .cse2)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (not (= 4 .cse3)) (not (= 4 .cse5)))))))))))) is different from false [2021-12-17 02:17:25,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int) (v_ArrVal_966 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_320| Int) (|v_ULTIMATE.start_main_~i~0#1_309| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_966 (+ (* |v_ULTIMATE.start_main_~i~0#1_320| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse3 .cse4 .cse6 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_309| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 5)) (not (= 4 .cse0)) (not (= 4 .cse1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 6) ~N~0) (= (+ .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse0) (* 4 ~N~0)) (not (= 4 .cse4)) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse5)))))))))))) is different from false [2021-12-17 02:17:32,915 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int) (v_ArrVal_966 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_320| Int) (|v_ULTIMATE.start_main_~i~0#1_309| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_966 (+ (* |v_ULTIMATE.start_main_~i~0#1_320| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_315| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4 .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_309| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 5)) (not (= 4 .cse0)) (not (= 4 .cse1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 6) ~N~0) (= (+ .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse1) (* 4 ~N~0)) (not (= 4 .cse4)) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse5)))))))))))) is different from false [2021-12-17 02:17:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2021-12-17 02:17:32,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503466480] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:17:32,968 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:17:32,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 28] total 76 [2021-12-17 02:17:32,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523940733] [2021-12-17 02:17:32,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:17:32,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2021-12-17 02:17:32,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:17:32,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-12-17 02:17:32,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=4033, Unknown=40, NotChecked=1370, Total=5700 [2021-12-17 02:17:32,970 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 76 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:17:43,612 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2021-12-17 02:17:43,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 02:17:43,613 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 76 states have internal predecessors, (110), 0 states have call successors, (0), 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 41 [2021-12-17 02:17:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:17:43,613 INFO L225 Difference]: With dead ends: 73 [2021-12-17 02:17:43,613 INFO L226 Difference]: Without dead ends: 69 [2021-12-17 02:17:43,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 40 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 74.6s TimeCoverageRelationStatistics Valid=299, Invalid=4393, Unknown=40, NotChecked=1430, Total=6162 [2021-12-17 02:17:43,615 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 624 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 02:17:43,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 253 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 505 Invalid, 0 Unknown, 624 Unchecked, 0.8s Time] [2021-12-17 02:17:43,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-17 02:17:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2021-12-17 02:17:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2021-12-17 02:17:43,622 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 41 [2021-12-17 02:17:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:17:43,622 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2021-12-17 02:17:43,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 76 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2021-12-17 02:17:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 02:17:43,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:17:43,623 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:17:43,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-12-17 02:17:43,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-17 02:17:43,839 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:17:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:17:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash 127479307, now seen corresponding path program 5 times [2021-12-17 02:17:43,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:17:43,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845966512] [2021-12-17 02:17:43,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:17:43,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:17:43,853 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:17:43,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1286168804] [2021-12-17 02:17:43,854 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:17:43,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:17:43,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:17:43,855 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:17:43,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-17 02:17:43,988 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-12-17 02:17:43,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:17:43,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-17 02:17:43,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:17:44,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-17 02:17:44,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 02:17:44,203 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-17 02:17:44,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 02:17:44,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-17 02:17:44,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-17 02:17:44,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-17 02:17:44,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2021-12-17 02:17:44,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-17 02:17:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:17:44,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:17:44,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-17 02:17:44,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)) is different from false [2021-12-17 02:17:44,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 12)) 4)) is different from false [2021-12-17 02:17:44,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 16)) 4)) is different from false [2021-12-17 02:17:44,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) 4)) is different from false [2021-12-17 02:17:44,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1045 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1045)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) 4)) is different from false [2021-12-17 02:17:44,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1045 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1045)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) 4)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:17:44,931 INFO L354 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2021-12-17 02:17:44,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2021-12-17 02:17:44,941 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:17:44,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-17 02:17:44,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:17:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 46 not checked. [2021-12-17 02:17:45,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:17:45,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845966512] [2021-12-17 02:17:45,036 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:17:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286168804] [2021-12-17 02:17:45,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286168804] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:17:45,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:17:45,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2021-12-17 02:17:45,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806267415] [2021-12-17 02:17:45,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:17:45,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 02:17:45,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:17:45,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 02:17:45,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=297, Unknown=7, NotChecked=280, Total=650 [2021-12-17 02:17:45,037 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:47,372 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1045 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1045)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) 4)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~i~0#1| 4) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))) is different from false [2021-12-17 02:17:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:17:47,984 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2021-12-17 02:17:47,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 02:17:47,985 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 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 41 [2021-12-17 02:17:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:17:47,986 INFO L225 Difference]: With dead ends: 77 [2021-12-17 02:17:47,986 INFO L226 Difference]: Without dead ends: 68 [2021-12-17 02:17:47,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=104, Invalid=570, Unknown=8, NotChecked=440, Total=1122 [2021-12-17 02:17:47,986 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 02:17:47,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 80 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 416 Invalid, 0 Unknown, 261 Unchecked, 0.6s Time] [2021-12-17 02:17:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-17 02:17:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-12-17 02:17:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2021-12-17 02:17:47,992 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 41 [2021-12-17 02:17:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:17:47,992 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2021-12-17 02:17:47,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2021-12-17 02:17:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 02:17:47,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:17:47,993 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:17:48,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-17 02:17:48,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:17:48,193 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:17:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:17:48,194 INFO L85 PathProgramCache]: Analyzing trace with hash -105011125, now seen corresponding path program 17 times [2021-12-17 02:17:48,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:17:48,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699601521] [2021-12-17 02:17:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:17:48,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:17:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:17:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:17:48,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:17:48,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699601521] [2021-12-17 02:17:48,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699601521] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:17:48,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536575983] [2021-12-17 02:17:48,569 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:17:48,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:17:48,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:17:48,570 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:17:48,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-17 02:17:48,710 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-12-17 02:17:48,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:17:48,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 02:17:48,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:17:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:17:49,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:17:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:17:49,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536575983] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:17:49,466 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:17:49,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2021-12-17 02:17:49,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100690533] [2021-12-17 02:17:49,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:17:49,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 02:17:49,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:17:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 02:17:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2021-12-17 02:17:49,467 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:17:50,583 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2021-12-17 02:17:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-17 02:17:50,584 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 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 43 [2021-12-17 02:17:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:17:50,585 INFO L225 Difference]: With dead ends: 85 [2021-12-17 02:17:50,585 INFO L226 Difference]: Without dead ends: 81 [2021-12-17 02:17:50,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2021-12-17 02:17:50,586 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 02:17:50,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 37 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 02:17:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-17 02:17:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2021-12-17 02:17:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2021-12-17 02:17:50,601 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2021-12-17 02:17:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:17:50,602 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2021-12-17 02:17:50,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2021-12-17 02:17:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 02:17:50,602 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:17:50,603 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:17:50,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-17 02:17:50,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:17:50,811 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:17:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:17:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2029167523, now seen corresponding path program 18 times [2021-12-17 02:17:50,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:17:50,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318541906] [2021-12-17 02:17:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:17:50,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:17:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:17:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:17:51,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:17:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318541906] [2021-12-17 02:17:51,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318541906] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:17:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472781064] [2021-12-17 02:17:51,305 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:17:51,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:17:51,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:17:51,306 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:17:51,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-17 02:17:51,441 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-12-17 02:17:51,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:17:51,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 02:17:51,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:17:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:17:51,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:17:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:17:52,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472781064] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:17:52,156 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:17:52,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2021-12-17 02:17:52,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016870722] [2021-12-17 02:17:52,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:17:52,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 02:17:52,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:17:52,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 02:17:52,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2021-12-17 02:17:52,157 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:17:52,743 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2021-12-17 02:17:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 02:17:52,744 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 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 44 [2021-12-17 02:17:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:17:52,744 INFO L225 Difference]: With dead ends: 94 [2021-12-17 02:17:52,744 INFO L226 Difference]: Without dead ends: 60 [2021-12-17 02:17:52,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2021-12-17 02:17:52,745 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 90 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 02:17:52,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 25 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 02:17:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-17 02:17:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2021-12-17 02:17:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-12-17 02:17:52,750 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 44 [2021-12-17 02:17:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:17:52,750 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-12-17 02:17:52,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:17:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2021-12-17 02:17:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 02:17:52,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:17:52,750 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:17:52,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-12-17 02:17:52,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-17 02:17:52,951 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:17:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:17:52,951 INFO L85 PathProgramCache]: Analyzing trace with hash -111213349, now seen corresponding path program 19 times [2021-12-17 02:17:52,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:17:52,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547468561] [2021-12-17 02:17:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:17:52,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:17:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:17:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:17:55,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:17:55,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547468561] [2021-12-17 02:17:55,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547468561] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:17:55,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930695686] [2021-12-17 02:17:55,878 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 02:17:55,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:17:55,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:17:55,879 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:17:55,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-17 02:17:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:17:55,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 93 conjunts are in the unsatisfiable core [2021-12-17 02:17:55,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:17:55,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-17 02:17:55,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:17:56,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:17:56,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:17:56,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:17:56,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:17:56,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:17:56,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:17:56,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-17 02:17:56,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-17 02:17:57,021 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:17:57,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-17 02:17:57,370 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:17:57,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-17 02:17:57,809 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:17:57,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-17 02:17:58,175 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 02:17:58,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-17 02:17:58,633 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 02:17:58,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 58 [2021-12-17 02:17:59,085 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 02:17:59,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2021-12-17 02:17:59,624 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 02:17:59,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 37 [2021-12-17 02:17:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:17:59,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:22:46,103 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_421| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_423| Int) (|v_ULTIMATE.start_main_~i~0#1_430| Int) (|v_ULTIMATE.start_main_~i~0#1_419| Int) (v_ArrVal_1261 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_425| Int) (|v_ULTIMATE.start_main_~i~0#1_417| Int) (|v_ULTIMATE.start_main_~i~0#1_427| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1261))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_1261 (+ (* |v_ULTIMATE.start_main_~i~0#1_430| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_427| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_425| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse7 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_423| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse7 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_421| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse7 .cse4 .cse5 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_419| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse7 .cse4 .cse5 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_417| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse4)) (not (= 4 .cse5)) (not (= 4 .cse6)) (= (+ .cse1 .cse0 .cse7 .cse4 .cse5 .cse6 .cse2 .cse3) (* 4 ~N~0))))))))))))))) is different from false [2021-12-17 02:23:51,555 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_421| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_423| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_430| Int) (|v_ULTIMATE.start_main_~i~0#1_419| Int) (v_ArrVal_1261 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_425| Int) (|v_ULTIMATE.start_main_~i~0#1_417| Int) (|v_ULTIMATE.start_main_~i~0#1_427| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1261))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_1261 (+ (* |v_ULTIMATE.start_main_~i~0#1_430| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_427| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_425| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse7 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_423| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse7 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_421| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse7 .cse4 .cse5 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_419| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse7 .cse4 .cse5 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_417| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (= 4 .cse2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse3)) (not (= 4 .cse4)) (not (= 4 .cse5)) (not (= 4 .cse6)) (= (+ .cse1 .cse0 .cse7 .cse4 .cse5 .cse6 .cse2 .cse3) (* 4 ~N~0))))))))))))) is different from false [2021-12-17 02:25:04,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_421| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_423| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_430| Int) (|v_ULTIMATE.start_main_~i~0#1_419| Int) (v_ArrVal_1261 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_425| Int) (|v_ULTIMATE.start_main_~i~0#1_417| Int) (|v_ULTIMATE.start_main_~i~0#1_427| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1261))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_1261 (+ (* |v_ULTIMATE.start_main_~i~0#1_430| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_427| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_425| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_423| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_421| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse4 .cse6 .cse7 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_419| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5 .cse4 .cse6 .cse7 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_417| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (= 4 .cse2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse3)) (not (= 4 .cse4)) (= (+ .cse1 .cse0 .cse5 .cse4 .cse6 .cse7 .cse2 .cse3) (* 4 ~N~0)) (not (= 4 .cse7)) (not (= 4 .cse6))))))))))))) is different from false [2021-12-17 02:26:14,177 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_421| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_423| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_430| Int) (|v_ULTIMATE.start_main_~i~0#1_419| Int) (v_ArrVal_1261 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_425| Int) (|v_ULTIMATE.start_main_~i~0#1_417| Int) (|v_ULTIMATE.start_main_~i~0#1_427| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1261))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_1261 (+ (* |v_ULTIMATE.start_main_~i~0#1_430| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_427| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_425| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_423| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse4 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_421| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse4 .cse6 .cse7 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_419| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5 .cse4 .cse6 .cse7 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_417| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse2)) (not (= 4 .cse3)) (not (= 4 .cse4)) (= (+ .cse1 .cse0 .cse5 .cse4 .cse6 .cse7 .cse2 .cse3) (* 4 ~N~0)) (not (= 4 .cse7)) (not (= 4 .cse6))))))))))))) is different from false Killed by 15