./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condg.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/condg.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 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:01:07,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:01:07,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:01:07,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:01:07,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:01:07,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:01:07,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:01:07,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:01:07,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:01:07,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:01:07,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:01:07,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:01:07,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:01:07,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:01:07,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:01:07,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:01:07,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:01:07,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:01:07,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:01:07,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:01:07,398 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:01:07,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:01:07,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:01:07,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:01:07,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:01:07,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:01:07,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:01:07,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:01:07,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:01:07,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:01:07,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:01:07,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:01:07,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:01:07,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:01:07,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:01:07,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:01:07,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:01:07,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:01:07,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:01:07,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:01:07,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:01:07,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:01:07,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:01:07,443 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:01:07,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:01:07,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:01:07,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:01:07,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:01:07,444 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:01:07,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:01:07,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:01:07,445 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:01:07,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:01:07,446 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:01:07,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:01:07,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:01:07,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:01:07,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:01:07,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:01:07,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:01:07,447 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:01:07,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:01:07,447 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:01:07,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:01:07,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:01:07,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:01:07,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:01:07,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:01:07,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:01:07,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:01:07,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:01:07,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:01:07,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:01:07,449 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:01:07,449 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:01:07,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:01:07,449 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 -> 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 [2022-07-13 11:01:07,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:01:07,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:01:07,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:01:07,661 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:01:07,661 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:01:07,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condg.c [2022-07-13 11:01:07,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39fefc835/b96da73366274e218cd0e99395f3c7b6/FLAGb9ecde774 [2022-07-13 11:01:08,032 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:01:08,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c [2022-07-13 11:01:08,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39fefc835/b96da73366274e218cd0e99395f3c7b6/FLAGb9ecde774 [2022-07-13 11:01:08,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39fefc835/b96da73366274e218cd0e99395f3c7b6 [2022-07-13 11:01:08,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:01:08,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:01:08,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:01:08,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:01:08,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:01:08,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6ef68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08, skipping insertion in model container [2022-07-13 11:01:08,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:01:08,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:01:08,597 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/condg.c[588,601] [2022-07-13 11:01:08,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:01:08,616 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:01:08,623 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/condg.c[588,601] [2022-07-13 11:01:08,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:01:08,635 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:01:08,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08 WrapperNode [2022-07-13 11:01:08,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:01:08,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:01:08,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:01:08,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:01:08,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,665 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-07-13 11:01:08,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:01:08,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:01:08,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:01:08,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:01:08,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:01:08,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:01:08,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:01:08,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:01:08,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (1/1) ... [2022-07-13 11:01:08,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:01:08,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:08,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:01:08,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:01:08,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:01:08,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:01:08,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:01:08,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:01:08,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:01:08,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:01:08,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:01:08,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:01:08,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:01:08,800 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:01:08,801 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:01:08,896 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:01:08,900 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:01:08,900 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 11:01:08,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:01:08 BoogieIcfgContainer [2022-07-13 11:01:08,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:01:08,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:01:08,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:01:08,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:01:08,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:01:08" (1/3) ... [2022-07-13 11:01:08,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fdc06a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:01:08, skipping insertion in model container [2022-07-13 11:01:08,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:08" (2/3) ... [2022-07-13 11:01:08,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fdc06a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:01:08, skipping insertion in model container [2022-07-13 11:01:08,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:01:08" (3/3) ... [2022-07-13 11:01:08,922 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2022-07-13 11:01:08,931 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:01:08,934 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:01:08,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:01:08,979 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64c27f5e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15c5be0 [2022-07-13 11:01:08,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:01:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:01:08,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:08,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:08,987 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:08,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:08,990 INFO L85 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2022-07-13 11:01:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:08,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170551179] [2022-07-13 11:01:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:08,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:09,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170551179] [2022-07-13 11:01:09,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170551179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:01:09,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:01:09,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:01:09,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799207556] [2022-07-13 11:01:09,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:01:09,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:01:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:09,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:01:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:01:09,157 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:09,171 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-07-13 11:01:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:01:09,173 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-13 11:01:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:09,178 INFO L225 Difference]: With dead ends: 46 [2022-07-13 11:01:09,179 INFO L226 Difference]: Without dead ends: 21 [2022-07-13 11:01:09,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:01:09,189 INFO L413 NwaCegarLoop]: 30 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, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:09,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:01:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-13 11:01:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-13 11:01:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-13 11:01:09,214 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-07-13 11:01:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:09,214 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-13 11:01:09,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-13 11:01:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:01:09,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:09,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:09,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:01:09,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:09,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2022-07-13 11:01:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:09,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45111769] [2022-07-13 11:01:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:09,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:09,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45111769] [2022-07-13 11:01:09,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45111769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:01:09,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:01:09,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:01:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396316059] [2022-07-13 11:01:09,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:01:09,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:01:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:01:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:01:09,317 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:09,375 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-07-13 11:01:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:01:09,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-13 11:01:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:09,378 INFO L225 Difference]: With dead ends: 48 [2022-07-13 11:01:09,378 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 11:01:09,380 INFO L412 NwaCegarLoop]: 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 [2022-07-13 11:01:09,382 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:09,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:01:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 11:01:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2022-07-13 11:01:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-13 11:01:09,388 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2022-07-13 11:01:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:09,388 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-13 11:01:09,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-13 11:01:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:01:09,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:09,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:09,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:01:09,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:09,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:09,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2022-07-13 11:01:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:09,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347159003] [2022-07-13 11:01:09,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:09,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:09,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347159003] [2022-07-13 11:01:09,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347159003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:09,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631513341] [2022-07-13 11:01:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:09,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:09,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:01:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:09,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 11:01:09,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:09,792 INFO L390 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 [2022-07-13 11:01:09,819 INFO L390 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 18 treesize of output 14 [2022-07-13 11:01:09,858 INFO L390 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 [2022-07-13 11:01:09,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 20 [2022-07-13 11:01:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:09,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:10,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_44 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_44) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)) is different from false [2022-07-13 11:01:10,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:01:10,111 INFO L390 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 [2022-07-13 11:01:10,122 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:01:10,122 INFO L390 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 [2022-07-13 11:01:10,126 INFO L390 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 9 [2022-07-13 11:01:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 11:01:10,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631513341] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:01:10,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:01:10,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-07-13 11:01:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196258206] [2022-07-13 11:01:10,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:01:10,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:01:10,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:10,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:01:10,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2022-07-13 11:01:10,182 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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) [2022-07-13 11:01:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:10,385 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-07-13 11:01:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:01:10,386 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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 21 [2022-07-13 11:01:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:10,389 INFO L225 Difference]: With dead ends: 56 [2022-07-13 11:01:10,389 INFO L226 Difference]: Without dead ends: 54 [2022-07-13 11:01:10,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=370, Unknown=1, NotChecked=40, Total=506 [2022-07-13 11:01:10,392 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:10,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 96 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 158 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-07-13 11:01:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-13 11:01:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2022-07-13 11:01:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-07-13 11:01:10,404 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2022-07-13 11:01:10,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:10,405 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-13 11:01:10,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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) [2022-07-13 11:01:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-07-13 11:01:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:01:10,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:10,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:10,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:01:10,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:10,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:10,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2022-07-13 11:01:10,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:10,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924453679] [2022-07-13 11:01:10,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:10,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:10,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924453679] [2022-07-13 11:01:10,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924453679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:10,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395030487] [2022-07-13 11:01:10,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:10,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:10,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:10,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:10,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:01:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:10,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 11:01:10,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:10,916 INFO L390 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 [2022-07-13 11:01:10,922 INFO L390 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 [2022-07-13 11:01:10,936 INFO L390 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 23 treesize of output 22 [2022-07-13 11:01:11,055 INFO L390 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 36 treesize of output 23 [2022-07-13 11:01:11,115 INFO L390 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 26 treesize of output 10 [2022-07-13 11:01:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:11,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:11,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:01:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:11,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395030487] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:01:11,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:01:11,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-07-13 11:01:11,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004959110] [2022-07-13 11:01:11,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:01:11,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 11:01:11,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:11,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 11:01:11,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-07-13 11:01:11,235 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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) [2022-07-13 11:01:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:11,412 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-07-13 11:01:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:01:11,412 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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 21 [2022-07-13 11:01:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:11,413 INFO L225 Difference]: With dead ends: 66 [2022-07-13 11:01:11,413 INFO L226 Difference]: Without dead ends: 56 [2022-07-13 11:01:11,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-07-13 11:01:11,414 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:11,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-07-13 11:01:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-13 11:01:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-07-13 11:01:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 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) [2022-07-13 11:01:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-07-13 11:01:11,418 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 21 [2022-07-13 11:01:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:11,418 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-07-13 11:01:11,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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) [2022-07-13 11:01:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-07-13 11:01:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 11:01:11,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:11,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:11,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:01:11,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 11:01:11,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1912499326, now seen corresponding path program 2 times [2022-07-13 11:01:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:11,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732945519] [2022-07-13 11:01:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:01:11,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:11,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732945519] [2022-07-13 11:01:11,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732945519] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:11,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636105846] [2022-07-13 11:01:11,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:01:11,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:11,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:11,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:11,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:01:11,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:01:11,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:01:11,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:01:11,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:01:11,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:01:11,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636105846] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:01:11,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:01:11,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-07-13 11:01:11,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232569897] [2022-07-13 11:01:11,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:01:11,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:01:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:11,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:01:11,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:01:11,787 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:11,968 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-07-13 11:01:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:01:11,969 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 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 [2022-07-13 11:01:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:11,969 INFO L225 Difference]: With dead ends: 93 [2022-07-13 11:01:11,969 INFO L226 Difference]: Without dead ends: 55 [2022-07-13 11:01:11,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:01:11,970 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 161 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:11,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 82 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:01:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-13 11:01:11,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-07-13 11:01:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 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) [2022-07-13 11:01:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-07-13 11:01:11,974 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2022-07-13 11:01:11,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:11,975 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-07-13 11:01:11,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-07-13 11:01:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:01:11,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:11,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:12,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:01:12,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:12,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:12,192 INFO L85 PathProgramCache]: Analyzing trace with hash 550852762, now seen corresponding path program 1 times [2022-07-13 11:01:12,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:12,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436522892] [2022-07-13 11:01:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:12,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 11:01:12,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:12,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436522892] [2022-07-13 11:01:12,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436522892] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:12,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341044295] [2022-07-13 11:01:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:12,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:12,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:12,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:12,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:01:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:12,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 11:01:12,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:12,314 INFO L390 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 [2022-07-13 11:01:12,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:12,331 INFO L390 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 15 treesize of output 17 [2022-07-13 11:01:12,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-13 11:01:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:01:12,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:12,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-13 11:01:12,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-13 11:01:12,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:01:12,370 INFO L390 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 18 treesize of output 19 [2022-07-13 11:01:12,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-13 11:01:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2022-07-13 11:01:12,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341044295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:01:12,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:01:12,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2022-07-13 11:01:12,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245045203] [2022-07-13 11:01:12,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:01:12,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:01:12,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:12,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:01:12,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-13 11:01:12,388 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:12,445 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-07-13 11:01:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:01:12,446 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 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 [2022-07-13 11:01:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:12,446 INFO L225 Difference]: With dead ends: 50 [2022-07-13 11:01:12,446 INFO L226 Difference]: Without dead ends: 40 [2022-07-13 11:01:12,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2022-07-13 11:01:12,447 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:12,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-07-13 11:01:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-13 11:01:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-13 11:01:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 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) [2022-07-13 11:01:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-07-13 11:01:12,456 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 28 [2022-07-13 11:01:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:12,458 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-07-13 11:01:12,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-07-13 11:01:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:01:12,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:12,459 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:12,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 11:01:12,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:12,675 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:12,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:12,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1969107172, now seen corresponding path program 3 times [2022-07-13 11:01:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:12,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313266932] [2022-07-13 11:01:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:01:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:13,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313266932] [2022-07-13 11:01:13,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313266932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:13,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543853396] [2022-07-13 11:01:13,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:01:13,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:13,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:13,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:13,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:01:13,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:01:13,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:01:13,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-13 11:01:13,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:13,317 INFO L390 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 [2022-07-13 11:01:13,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:13,344 INFO L390 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 23 treesize of output 22 [2022-07-13 11:01:13,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:13,415 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-13 11:01:13,416 INFO L390 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-13 11:01:13,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:01:13,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:13,553 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:01:13,553 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 41 [2022-07-13 11:01:13,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:13,636 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-13 11:01:13,636 INFO L390 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 55 treesize of output 48 [2022-07-13 11:01:13,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:13,851 INFO L356 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-07-13 11:01:13,851 INFO L390 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 39 treesize of output 37 [2022-07-13 11:01:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:13,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:16,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (let ((.cse1 (<= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (<= |v_ULTIMATE.start_main_~i~0#1_69| 0)) (.cse0 (let ((.cse7 (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|) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |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_69| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse6))))))) (and (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_69| 1) .cse0) .cse1 .cse2) (or .cse1 .cse2 (<= .cse0 2)))) (not (<= |v_ULTIMATE.start_main_~i~0#1_69| 1)))) is different from false [2022-07-13 11:01:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 11:01:52,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543853396] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:01:52,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:01:52,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 46 [2022-07-13 11:01:52,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207349165] [2022-07-13 11:01:52,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:01:52,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-13 11:01:52,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:52,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-13 11:01:52,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1689, Unknown=23, NotChecked=86, Total=2070 [2022-07-13 11:01:52,761 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:31,687 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-07-13 11:02:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 11:02:31,687 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 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 [2022-07-13 11:02:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:31,689 INFO L225 Difference]: With dead ends: 79 [2022-07-13 11:02:31,689 INFO L226 Difference]: Without dead ends: 64 [2022-07-13 11:02:31,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 77.7s TimeCoverageRelationStatistics Valid=473, Invalid=3028, Unknown=43, NotChecked=116, Total=3660 [2022-07-13 11:02:31,690 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:31,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 151 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 258 Unchecked, 0.1s Time] [2022-07-13 11:02:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-13 11:02:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-07-13 11:02:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-07-13 11:02:31,705 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2022-07-13 11:02:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:31,706 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-07-13 11:02:31,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-07-13 11:02:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 11:02:31,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:31,710 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:31,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:02:31,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:31,927 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1202810022, now seen corresponding path program 4 times [2022-07-13 11:02:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:02:31,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844072979] [2022-07-13 11:02:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:02:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:02:31,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:02:31,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844072979] [2022-07-13 11:02:31,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844072979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:02:31,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608951431] [2022-07-13 11:02:31,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:02:31,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:31,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:02:31,987 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:02:31,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:02:32,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:02:32,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:02:32,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:02:32,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:02:32,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:02:32,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608951431] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:02:32,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:02:32,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:02:32,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098269778] [2022-07-13 11:02:32,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:02:32,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:02:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:02:32,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:02:32,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:02:32,086 INFO L87 Difference]: Start difference. First operand 55 states and 66 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) [2022-07-13 11:02:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:32,220 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2022-07-13 11:02:32,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:02:32,221 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 30 [2022-07-13 11:02:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:32,221 INFO L225 Difference]: With dead ends: 142 [2022-07-13 11:02:32,222 INFO L226 Difference]: Without dead ends: 113 [2022-07-13 11:02:32,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:02:32,222 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 118 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:32,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 70 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:02:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-13 11:02:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 85. [2022-07-13 11:02:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 84 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2022-07-13 11:02:32,231 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 30 [2022-07-13 11:02:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:32,231 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2022-07-13 11:02:32,231 INFO L496 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) [2022-07-13 11:02:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2022-07-13 11:02:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:02:32,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:32,232 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:32,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:02:32,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:32,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash -736332014, now seen corresponding path program 1 times [2022-07-13 11:02:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:02:32,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640332715] [2022-07-13 11:02:32,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:02:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:02:32,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640332715] [2022-07-13 11:02:32,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640332715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:02:32,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016449388] [2022-07-13 11:02:32,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:32,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:32,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:02:32,894 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) [2022-07-13 11:02:32,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:02:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:32,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-13 11:02:32,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:32,964 INFO L390 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 [2022-07-13 11:02:32,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:32,984 INFO L390 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 23 treesize of output 22 [2022-07-13 11:02:33,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:33,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:33,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 11:02:33,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:02:33,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:33,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:33,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-13 11:02:33,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:33,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:33,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-07-13 11:02:33,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:33,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:33,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:02:33,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2022-07-13 11:02:33,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:33,436 INFO L390 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 40 treesize of output 27 [2022-07-13 11:02:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:33,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:34,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016449388] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:02:34,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:02:34,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 50 [2022-07-13 11:02:34,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874566452] [2022-07-13 11:02:34,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:02:34,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 11:02:34,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:02:34,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 11:02:34,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2182, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 11:02:34,204 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:35,919 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-07-13 11:02:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-13 11:02:35,919 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 0 states have call successors, (0), 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 32 [2022-07-13 11:02:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:35,920 INFO L225 Difference]: With dead ends: 106 [2022-07-13 11:02:35,920 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 11:02:35,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=900, Invalid=5580, Unknown=0, NotChecked=0, Total=6480 [2022-07-13 11:02:35,921 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 87 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:35,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 227 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 436 Invalid, 0 Unknown, 113 Unchecked, 0.3s Time] [2022-07-13 11:02:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 11:02:35,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-07-13 11:02:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.186046511627907) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-07-13 11:02:35,930 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 32 [2022-07-13 11:02:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:35,930 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-07-13 11:02:35,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-07-13 11:02:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:02:35,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:35,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:35,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:02:36,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:36,147 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:36,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash -35267436, now seen corresponding path program 1 times [2022-07-13 11:02:36,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:02:36,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010861831] [2022-07-13 11:02:36,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:36,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:02:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:02:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:02:36,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010861831] [2022-07-13 11:02:36,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010861831] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:02:36,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487918707] [2022-07-13 11:02:36,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:36,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:36,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:02:36,200 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) [2022-07-13 11:02:36,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:02:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:36,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 11:02:36,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:36,267 INFO L390 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 [2022-07-13 11:02:36,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:36,282 INFO L390 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 [2022-07-13 11:02:36,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 11:02:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:02:36,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:36,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-13 11:02:36,295 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-13 11:02:36,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:02:36,302 INFO L390 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 18 treesize of output 19 [2022-07-13 11:02:36,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-13 11:02:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2022-07-13 11:02:36,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487918707] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:02:36,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:02:36,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2022-07-13 11:02:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097749611] [2022-07-13 11:02:36,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:02:36,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:02:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:02:36,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:02:36,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-13 11:02:36,312 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 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) [2022-07-13 11:02:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:36,375 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-07-13 11:02:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:02:36,375 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 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 32 [2022-07-13 11:02:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:36,376 INFO L225 Difference]: With dead ends: 101 [2022-07-13 11:02:36,376 INFO L226 Difference]: Without dead ends: 68 [2022-07-13 11:02:36,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2022-07-13 11:02:36,377 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:36,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-07-13 11:02:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-13 11:02:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-13 11:02:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-07-13 11:02:36,389 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 32 [2022-07-13 11:02:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:36,389 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-07-13 11:02:36,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 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) [2022-07-13 11:02:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-07-13 11:02:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:02:36,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:36,391 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:36,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:02:36,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 11:02:36,597 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:36,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash -767176616, now seen corresponding path program 5 times [2022-07-13 11:02:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:02:36,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953229139] [2022-07-13 11:02:36,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:36,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:02:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:02:36,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:02:36,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953229139] [2022-07-13 11:02:36,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953229139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:02:36,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116636865] [2022-07-13 11:02:36,641 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:02:36,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:36,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:02:36,642 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) [2022-07-13 11:02:36,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 11:02:36,696 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:02:36,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:02:36,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:02:36,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:02:36,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:02:36,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116636865] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:02:36,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:02:36,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:02:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427516600] [2022-07-13 11:02:36,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:02:36,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:02:36,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:02:36,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:02:36,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:02:36,789 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:36,911 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-07-13 11:02:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:02:36,912 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 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 32 [2022-07-13 11:02:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:36,912 INFO L225 Difference]: With dead ends: 91 [2022-07-13 11:02:36,912 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 11:02:36,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:02:36,913 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:36,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 65 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:02:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 11:02:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 41. [2022-07-13 11:02:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 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) [2022-07-13 11:02:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-13 11:02:36,918 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 32 [2022-07-13 11:02:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:36,919 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-13 11:02:36,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-13 11:02:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:02:36,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:36,920 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:36,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 11:02:37,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:37,131 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash -143226682, now seen corresponding path program 2 times [2022-07-13 11:02:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:02:37,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501343340] [2022-07-13 11:02:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:02:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:02:37,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:02:37,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501343340] [2022-07-13 11:02:37,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501343340] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:02:37,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146883467] [2022-07-13 11:02:37,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:02:37,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:37,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:02:37,397 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) [2022-07-13 11:02:37,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 11:02:37,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:02:37,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:02:37,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 11:02:37,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:37,487 INFO L390 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 [2022-07-13 11:02:37,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:37,530 INFO L390 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 23 treesize of output 22 [2022-07-13 11:02:37,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:37,569 INFO L390 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 23 treesize of output 22 [2022-07-13 11:02:37,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:37,601 INFO L390 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 [2022-07-13 11:02:37,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:37,611 INFO L390 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 [2022-07-13 11:02:37,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:37,622 INFO L390 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 [2022-07-13 11:02:37,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:02:37,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:02:37,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 33 treesize of output 29 [2022-07-13 11:02:37,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:37,704 INFO L390 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 23 treesize of output 22 [2022-07-13 11:02:37,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:37,737 INFO L390 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 23 treesize of output 22 [2022-07-13 11:02:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:02:37,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:39,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-07-13 11:02:45,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)))) is different from false [2022-07-13 11:02:47,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-13 11:02:47,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)) (= (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-13 11:02:48,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (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_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) is different from false [2022-07-13 11:02:48,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) is different from false [2022-07-13 11:02:48,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (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_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:02:48,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))))) is different from false [2022-07-13 11:02:48,081 INFO L356 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2022-07-13 11:02:48,081 INFO L390 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 3 case distinctions, treesize of input 88 treesize of output 73 [2022-07-13 11:02:48,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2022-07-13 11:02:48,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:02:48,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:02:48,091 INFO L390 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 9 [2022-07-13 11:02:48,097 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:02:48,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 174 treesize of output 176 [2022-07-13 11:02:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 22 not checked. [2022-07-13 11:02:48,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146883467] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:02:48,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:02:48,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 42 [2022-07-13 11:02:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783986230] [2022-07-13 11:02:48,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:02:48,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 11:02:48,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:02:48,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 11:02:48,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=948, Unknown=18, NotChecked=568, Total=1722 [2022-07-13 11:02:48,150 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:50,167 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))))) (or (= (select .cse0 0) 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:02:52,197 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (or (= (select .cse1 0) 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:03:00,748 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (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|)) 0)) is different from false [2022-07-13 11:03:02,799 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:03:04,843 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:03:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:03:05,083 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-07-13 11:03:05,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-13 11:03:05,084 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 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 35 [2022-07-13 11:03:05,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:03:05,084 INFO L225 Difference]: With dead ends: 80 [2022-07-13 11:03:05,084 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 11:03:05,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=484, Invalid=2404, Unknown=26, NotChecked=1508, Total=4422 [2022-07-13 11:03:05,086 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:03:05,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 217 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 343 Invalid, 0 Unknown, 492 Unchecked, 0.1s Time] [2022-07-13 11:03:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 11:03:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2022-07-13 11:03:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:03:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-13 11:03:05,093 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 35 [2022-07-13 11:03:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:03:05,093 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-13 11:03:05,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:03:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-13 11:03:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:03:05,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:03:05,093 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:03:05,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 11:03:05,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 11:03:05,299 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:03:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:03:05,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1123059706, now seen corresponding path program 2 times [2022-07-13 11:03:05,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:03:05,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289127784] [2022-07-13 11:03:05,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:03:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:03:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:03:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 11:03:05,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:03:05,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289127784] [2022-07-13 11:03:05,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289127784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:03:05,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560914149] [2022-07-13 11:03:05,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:03:05,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:03:05,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:03:05,347 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) [2022-07-13 11:03:05,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 11:03:05,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:03:05,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:03:05,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 11:03:05,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:03:05,462 INFO L390 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 [2022-07-13 11:03:05,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:05,480 INFO L390 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 15 treesize of output 17 [2022-07-13 11:03:05,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:05,499 INFO L390 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 15 treesize of output 17 [2022-07-13 11:03:05,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-13 11:03:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:03:05,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:03:05,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) is different from false [2022-07-13 11:03:05,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-13 11:03:05,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-13 11:03:05,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:03:05,536 INFO L390 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 18 treesize of output 19 [2022-07-13 11:03:05,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-13 11:03:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2022-07-13 11:03:05,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560914149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:03:05,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:03:05,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2022-07-13 11:03:05,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526996106] [2022-07-13 11:03:05,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:03:05,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 11:03:05,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:03:05,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 11:03:05,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=119, Unknown=3, NotChecked=72, Total=240 [2022-07-13 11:03:05,552 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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) [2022-07-13 11:03:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:03:05,843 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-07-13 11:03:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 11:03:05,845 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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 35 [2022-07-13 11:03:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:03:05,846 INFO L225 Difference]: With dead ends: 116 [2022-07-13 11:03:05,846 INFO L226 Difference]: Without dead ends: 100 [2022-07-13 11:03:05,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2022-07-13 11:03:05,846 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 112 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:03:05,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 158 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 279 Invalid, 0 Unknown, 239 Unchecked, 0.1s Time] [2022-07-13 11:03:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-13 11:03:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 52. [2022-07-13 11:03:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 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) [2022-07-13 11:03:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-13 11:03:05,854 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-07-13 11:03:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:03:05,855 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-13 11:03:05,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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) [2022-07-13 11:03:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-13 11:03:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:03:05,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:03:05,855 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:03:05,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:03:06,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 11:03:06,060 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:03:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:03:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash 651947656, now seen corresponding path program 6 times [2022-07-13 11:03:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:03:06,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793130367] [2022-07-13 11:03:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:03:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:03:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:03:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:03:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:03:06,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793130367] [2022-07-13 11:03:06,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793130367] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:03:06,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947343351] [2022-07-13 11:03:06,795 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:03:06,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:03:06,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:03:06,796 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) [2022-07-13 11:03:06,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 11:03:06,861 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-13 11:03:06,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:03:06,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-13 11:03:06,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:03:06,869 INFO L390 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 [2022-07-13 11:03:06,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:06,916 INFO L390 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 23 treesize of output 22 [2022-07-13 11:03:06,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:06,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:06,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-13 11:03:07,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-07-13 11:03:07,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:03:07,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-13 11:03:07,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,316 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-13 11:03:07,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 60 [2022-07-13 11:03:07,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:03:07,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:03:07,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2022-07-13 11:03:07,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,600 INFO L390 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 63 treesize of output 55 [2022-07-13 11:03:07,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:07,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 25 [2022-07-13 11:03:07,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 11:03:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:03:07,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:03:07,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-13 11:03:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 3 times theorem prover too weak. 2 trivial. 7 not checked. [2022-07-13 11:03:14,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947343351] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:03:14,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:03:14,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 18] total 53 [2022-07-13 11:03:14,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818867713] [2022-07-13 11:03:14,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:03:14,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 11:03:14,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:03:14,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 11:03:14,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2342, Unknown=16, NotChecked=100, Total=2756 [2022-07-13 11:03:14,522 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:03:15,368 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (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|)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)))) is different from false [2022-07-13 11:03:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:03:15,453 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2022-07-13 11:03:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 11:03:15,454 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 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 35 [2022-07-13 11:03:15,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:03:15,454 INFO L225 Difference]: With dead ends: 91 [2022-07-13 11:03:15,454 INFO L226 Difference]: Without dead ends: 73 [2022-07-13 11:03:15,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=461, Invalid=3816, Unknown=21, NotChecked=258, Total=4556 [2022-07-13 11:03:15,456 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:03:15,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 156 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 222 Invalid, 0 Unknown, 215 Unchecked, 0.1s Time] [2022-07-13 11:03:15,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-13 11:03:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2022-07-13 11:03:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 68 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) [2022-07-13 11:03:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-13 11:03:15,463 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 35 [2022-07-13 11:03:15,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:03:15,463 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-13 11:03:15,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:03:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-07-13 11:03:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:03:15,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:03:15,464 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:03:15,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 11:03:15,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 11:03:15,665 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:03:15,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:03:15,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1015472054, now seen corresponding path program 7 times [2022-07-13 11:03:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:03:15,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940265083] [2022-07-13 11:03:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:03:15,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:03:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:03:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:03:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:03:15,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940265083] [2022-07-13 11:03:15,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940265083] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:03:15,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337326043] [2022-07-13 11:03:15,725 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:03:15,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:03:15,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:03:15,726 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) [2022-07-13 11:03:15,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 11:03:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:03:15,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:03:15,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:03:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:03:15,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:03:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:03:15,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337326043] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:03:15,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:03:15,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:03:15,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971538029] [2022-07-13 11:03:15,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:03:15,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:03:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:03:15,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:03:15,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:03:15,890 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) [2022-07-13 11:03:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:03:16,166 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2022-07-13 11:03:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:03:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) Word has length 37 [2022-07-13 11:03:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:03:16,167 INFO L225 Difference]: With dead ends: 173 [2022-07-13 11:03:16,167 INFO L226 Difference]: Without dead ends: 141 [2022-07-13 11:03:16,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:03:16,168 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 133 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:03:16,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 204 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:03:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-13 11:03:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 85. [2022-07-13 11:03:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:03:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2022-07-13 11:03:16,177 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 37 [2022-07-13 11:03:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:03:16,177 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2022-07-13 11:03:16,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) [2022-07-13 11:03:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2022-07-13 11:03:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:03:16,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:03:16,177 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:03:16,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 11:03:16,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 11:03:16,378 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:03:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:03:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash -590527364, now seen corresponding path program 2 times [2022-07-13 11:03:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:03:16,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308204111] [2022-07-13 11:03:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:03:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:03:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:03:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:03:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:03:16,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308204111] [2022-07-13 11:03:16,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308204111] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:03:16,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984249991] [2022-07-13 11:03:16,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:03:16,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:03:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:03:16,932 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) [2022-07-13 11:03:16,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 11:03:16,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:03:16,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:03:16,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-13 11:03:16,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:03:16,998 INFO L390 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 [2022-07-13 11:03:17,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,033 INFO L390 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 23 treesize of output 22 [2022-07-13 11:03:17,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-13 11:03:17,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-07-13 11:03:17,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:03:17,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-13 11:03:17,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:03:17,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-07-13 11:03:17,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 55 [2022-07-13 11:03:17,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:03:17,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2022-07-13 11:03:17,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:03:17,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2022-07-13 11:03:17,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:03:17,814 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-13 11:03:17,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-07-13 11:03:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:03:17,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:03:20,134 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) is different from false [2022-07-13 11:03:20,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)))) is different from false [2022-07-13 11:03:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-13 11:03:44,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984249991] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:03:44,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:03:44,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 23] total 67 [2022-07-13 11:03:44,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359303248] [2022-07-13 11:03:44,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:03:44,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-13 11:03:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:03:44,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-13 11:03:44,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=3608, Unknown=37, NotChecked=254, Total=4422 [2022-07-13 11:03:44,033 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:03:53,023 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (= (select .cse0 .cse1) 0))) (and (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (or (not (= .cse1 4)) .cse2) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))) .cse2 (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)))) is different from false [2022-07-13 11:03:53,468 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse2 4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 1))) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-13 11:03:55,534 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-13 11:04:31,357 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-13 11:04:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:04:34,418 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2022-07-13 11:04:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-07-13 11:04:34,418 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 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 [2022-07-13 11:04:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:04:34,419 INFO L225 Difference]: With dead ends: 123 [2022-07-13 11:04:34,419 INFO L226 Difference]: Without dead ends: 121 [2022-07-13 11:04:34,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3198 ImplicationChecksByTransitivity, 76.9s TimeCoverageRelationStatistics Valid=1390, Invalid=8819, Unknown=117, NotChecked=1230, Total=11556 [2022-07-13 11:04:34,421 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 63 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 436 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:04:34,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 337 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 502 Invalid, 0 Unknown, 436 Unchecked, 0.3s Time] [2022-07-13 11:04:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-13 11:04:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2022-07-13 11:04:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.19) internal successors, (119), 100 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:04:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2022-07-13 11:04:34,432 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 39 [2022-07-13 11:04:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:04:34,433 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2022-07-13 11:04:34,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:04:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2022-07-13 11:04:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:04:34,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:04:34,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:04:34,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 11:04:34,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:04:34,634 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:04:34,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:04:34,634 INFO L85 PathProgramCache]: Analyzing trace with hash 110537214, now seen corresponding path program 2 times [2022-07-13 11:04:34,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:04:34,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410710414] [2022-07-13 11:04:34,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:04:34,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:04:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:04:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:04:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:04:34,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410710414] [2022-07-13 11:04:34,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410710414] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:04:34,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350745254] [2022-07-13 11:04:34,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:04:34,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:04:34,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:04:34,692 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) [2022-07-13 11:04:34,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 11:04:34,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:04:34,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:04:34,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 11:04:34,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:04:34,825 INFO L390 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 [2022-07-13 11:04:34,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:34,845 INFO L390 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 [2022-07-13 11:04:34,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:34,863 INFO L390 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 [2022-07-13 11:04:34,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 11:04:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:04:34,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:04:34,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-13 11:04:34,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-13 11:04:34,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-13 11:04:34,895 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:04:34,895 INFO L390 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 18 treesize of output 19 [2022-07-13 11:04:34,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-13 11:04:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 12 not checked. [2022-07-13 11:04:34,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350745254] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:04:34,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:04:34,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2022-07-13 11:04:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717673499] [2022-07-13 11:04:34,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:04:34,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 11:04:34,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:04:34,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 11:04:34,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=119, Unknown=3, NotChecked=72, Total=240 [2022-07-13 11:04:34,909 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 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) [2022-07-13 11:04:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:04:35,190 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-07-13 11:04:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 11:04:35,191 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 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 39 [2022-07-13 11:04:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:04:35,191 INFO L225 Difference]: With dead ends: 150 [2022-07-13 11:04:35,191 INFO L226 Difference]: Without dead ends: 136 [2022-07-13 11:04:35,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2022-07-13 11:04:35,192 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 150 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:04:35,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 137 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 275 Invalid, 0 Unknown, 171 Unchecked, 0.1s Time] [2022-07-13 11:04:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-13 11:04:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 96. [2022-07-13 11:04:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 95 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:04:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2022-07-13 11:04:35,203 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 39 [2022-07-13 11:04:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:04:35,203 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2022-07-13 11:04:35,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 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) [2022-07-13 11:04:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-07-13 11:04:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 11:04:35,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:04:35,204 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:04:35,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 11:04:35,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 11:04:35,404 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:04:35,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:04:35,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1487374188, now seen corresponding path program 8 times [2022-07-13 11:04:35,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:04:35,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188534806] [2022-07-13 11:04:35,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:04:35,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:04:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:04:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:04:36,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:04:36,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188534806] [2022-07-13 11:04:36,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188534806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:04:36,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658957463] [2022-07-13 11:04:36,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:04:36,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:04:36,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:04:36,516 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) [2022-07-13 11:04:36,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 11:04:36,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:04:36,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:04:36,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 11:04:36,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:04:36,590 INFO L390 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 [2022-07-13 11:04:36,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,617 INFO L390 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 23 treesize of output 22 [2022-07-13 11:04:36,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-13 11:04:36,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-13 11:04:36,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:36,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-07-13 11:04:37,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:04:37,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-07-13 11:04:37,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:04:37,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-07-13 11:04:37,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:04:37,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2022-07-13 11:04:37,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-07-13 11:04:37,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:37,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23 [2022-07-13 11:04:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:04:37,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:04:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:04:40,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658957463] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:04:40,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:04:40,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 60 [2022-07-13 11:04:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670521930] [2022-07-13 11:04:40,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:04:40,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-13 11:04:40,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:04:40,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-13 11:04:40,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3268, Unknown=0, NotChecked=0, Total=3540 [2022-07-13 11:04:40,138 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:04:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:04:42,094 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-07-13 11:04:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 11:04:42,095 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 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 42 [2022-07-13 11:04:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:04:42,095 INFO L225 Difference]: With dead ends: 132 [2022-07-13 11:04:42,095 INFO L226 Difference]: Without dead ends: 114 [2022-07-13 11:04:42,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=332, Invalid=4090, Unknown=0, NotChecked=0, Total=4422 [2022-07-13 11:04:42,096 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:04:42,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 221 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1076 Invalid, 0 Unknown, 52 Unchecked, 1.4s Time] [2022-07-13 11:04:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-13 11:04:42,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-07-13 11:04:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:04:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-07-13 11:04:42,111 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 42 [2022-07-13 11:04:42,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:04:42,112 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-07-13 11:04:42,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:04:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-07-13 11:04:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:04:42,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:04:42,112 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:04:42,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 11:04:42,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 11:04:42,313 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:04:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:04:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2085827890, now seen corresponding path program 3 times [2022-07-13 11:04:42,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:04:42,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158273260] [2022-07-13 11:04:42,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:04:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:04:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:04:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:04:42,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:04:42,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158273260] [2022-07-13 11:04:42,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158273260] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:04:42,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284188815] [2022-07-13 11:04:42,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:04:42,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:04:42,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:04:42,819 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) [2022-07-13 11:04:42,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 11:04:42,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 11:04:42,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:04:42,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 11:04:42,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:04:42,914 INFO L390 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 [2022-07-13 11:04:43,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:43,016 INFO L390 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 [2022-07-13 11:04:43,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:43,058 INFO L390 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 [2022-07-13 11:04:43,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:04:43,113 INFO L390 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 [2022-07-13 11:04:43,244 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-13 11:04:43,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-07-13 11:04:43,325 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-13 11:04:43,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-07-13 11:04:43,479 INFO L356 Elim1Store]: treesize reduction 34, result has 48.5 percent of original size [2022-07-13 11:04:43,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 52 [2022-07-13 11:04:44,005 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-13 11:04:44,005 INFO L390 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 48 treesize of output 27 [2022-07-13 11:04:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:04:44,025 INFO L328 TraceCheckSpWp]: Computing backward predicates...