./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s5lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/s5lif.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 ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:56:15,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:56:15,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:56:16,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:56:16,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:56:16,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:56:16,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:56:16,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:56:16,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:56:16,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:56:16,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:56:16,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:56:16,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:56:16,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:56:16,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:56:16,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:56:16,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:56:16,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:56:16,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:56:16,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:56:16,075 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:56:16,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:56:16,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:56:16,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:56:16,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:56:16,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:56:16,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:56:16,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:56:16,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:56:16,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:56:16,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:56:16,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:56:16,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:56:16,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:56:16,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:56:16,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:56:16,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:56:16,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:56:16,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:56:16,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:56:16,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:56:16,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:56:16,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:56:16,125 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:56:16,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:56:16,126 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:56:16,126 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:56:16,127 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:56:16,127 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:56:16,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:56:16,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:56:16,128 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:56:16,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:56:16,130 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:56:16,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:56:16,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:56:16,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:56:16,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:56:16,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:56:16,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:56:16,131 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:56:16,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:56:16,131 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:56:16,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:56:16,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:56:16,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:56:16,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:56:16,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:56:16,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:56:16,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:56:16,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:56:16,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:56:16,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:56:16,133 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:56:16,134 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:56:16,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:56:16,134 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 -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2022-07-22 10:56:16,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:56:16,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:56:16,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:56:16,390 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:56:16,391 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:56:16,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5lif.c [2022-07-22 10:56:16,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f10c6863/129649edd9eb418ba4b65aef2bb15e17/FLAG3a2db2b16 [2022-07-22 10:56:16,855 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:56:16,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5lif.c [2022-07-22 10:56:16,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f10c6863/129649edd9eb418ba4b65aef2bb15e17/FLAG3a2db2b16 [2022-07-22 10:56:17,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f10c6863/129649edd9eb418ba4b65aef2bb15e17 [2022-07-22 10:56:17,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:56:17,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:56:17,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:56:17,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:56:17,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:56:17,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37dd24ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17, skipping insertion in model container [2022-07-22 10:56:17,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:56:17,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:56:17,439 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/s5lif.c[588,601] [2022-07-22 10:56:17,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:56:17,478 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:56:17,492 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/s5lif.c[588,601] [2022-07-22 10:56:17,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:56:17,523 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:56:17,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17 WrapperNode [2022-07-22 10:56:17,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:56:17,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:56:17,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:56:17,525 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:56:17,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,567 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-22 10:56:17,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:56:17,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:56:17,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:56:17,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:56:17,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:56:17,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:56:17,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:56:17,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:56:17,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (1/1) ... [2022-07-22 10:56:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:56:17,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:17,665 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-22 10:56:17,688 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-22 10:56:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:56:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:56:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:56:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:56:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:56:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:56:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:56:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:56:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:56:17,759 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:56:17,761 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:56:17,938 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:56:17,943 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:56:17,944 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 10:56:17,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:56:17 BoogieIcfgContainer [2022-07-22 10:56:17,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:56:17,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:56:17,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:56:17,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:56:17,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:56:17" (1/3) ... [2022-07-22 10:56:17,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4688a10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:56:17, skipping insertion in model container [2022-07-22 10:56:17,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:56:17" (2/3) ... [2022-07-22 10:56:17,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4688a10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:56:17, skipping insertion in model container [2022-07-22 10:56:17,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:56:17" (3/3) ... [2022-07-22 10:56:17,962 INFO L111 eAbstractionObserver]: Analyzing ICFG s5lif.c [2022-07-22 10:56:17,989 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:56:17,990 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:56:18,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:56:18,034 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@df02472, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@260cda23 [2022-07-22 10:56:18,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:56:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 10:56:18,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:18,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:56:18,045 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-07-22 10:56:18,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:18,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67061829] [2022-07-22 10:56:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:18,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:18,170 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-22 10:56:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:18,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67061829] [2022-07-22 10:56:18,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67061829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:56:18,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:56:18,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:56:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716644573] [2022-07-22 10:56:18,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:56:18,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:56:18,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:18,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:56:18,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:56:18,213 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-22 10:56:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:18,230 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-22 10:56:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:56:18,233 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-07-22 10:56:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:18,239 INFO L225 Difference]: With dead ends: 40 [2022-07-22 10:56:18,240 INFO L226 Difference]: Without dead ends: 18 [2022-07-22 10:56:18,243 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-22 10:56:18,247 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:18,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:56:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-22 10:56:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-22 10:56:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-22 10:56:18,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-07-22 10:56:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:18,276 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-22 10:56:18,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-22 10:56:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-22 10:56:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 10:56:18,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:18,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:56:18,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:56:18,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-07-22 10:56:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:18,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965828195] [2022-07-22 10:56:18,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:18,355 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-22 10:56:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:18,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965828195] [2022-07-22 10:56:18,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965828195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:56:18,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:56:18,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:56:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574998408] [2022-07-22 10:56:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:56:18,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:56:18,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:18,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:56:18,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:56:18,359 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-22 10:56:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:18,409 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-22 10:56:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:56:18,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-07-22 10:56:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:18,411 INFO L225 Difference]: With dead ends: 36 [2022-07-22 10:56:18,411 INFO L226 Difference]: Without dead ends: 25 [2022-07-22 10:56:18,411 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-22 10:56:18,412 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:18,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:56:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-22 10:56:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-22 10:56:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-22 10:56:18,418 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-22 10:56:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:18,418 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-22 10:56:18,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-22 10:56:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-22 10:56:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:56:18,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:18,420 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] [2022-07-22 10:56:18,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:56:18,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:18,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:18,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-07-22 10:56:18,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:18,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630049879] [2022-07-22 10:56:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:18,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:19,003 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-22 10:56:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:19,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630049879] [2022-07-22 10:56:19,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630049879] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:19,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528255213] [2022-07-22 10:56:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:19,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:19,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:19,009 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-22 10:56:19,033 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-22 10:56:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:19,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 10:56:19,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:19,174 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-22 10:56:19,189 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 11 treesize of output 7 [2022-07-22 10:56:19,233 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-22 10:56:19,385 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 32 treesize of output 23 [2022-07-22 10:56:19,504 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-22 10:56:19,634 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 47 treesize of output 27 [2022-07-22 10:56:19,668 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-22 10:56:19,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:20,026 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:56:20,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 44 [2022-07-22 10:56:20,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:56:20,101 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 59 treesize of output 52 [2022-07-22 10:56:20,106 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-22 10:56:20,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:56:20,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 46 treesize of output 34 [2022-07-22 10:56:20,125 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-22 10:56:20,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528255213] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:20,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:20,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2022-07-22 10:56:20,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029747155] [2022-07-22 10:56:20,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:20,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 10:56:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 10:56:20,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-07-22 10:56:20,129 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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-22 10:56:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:20,538 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-22 10:56:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 10:56:20,539 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 10:56:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:20,541 INFO L225 Difference]: With dead ends: 46 [2022-07-22 10:56:20,541 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 10:56:20,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 10:56:20,543 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:20,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 182 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-07-22 10:56:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 10:56:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-07-22 10:56:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-22 10:56:20,558 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-07-22 10:56:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:20,559 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-22 10:56:20,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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-22 10:56:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-22 10:56:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:56:20,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:20,560 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] [2022-07-22 10:56:20,588 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-22 10:56:20,785 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-22 10:56:20,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:20,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:20,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-07-22 10:56:20,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:20,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156060940] [2022-07-22 10:56:20,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:56:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156060940] [2022-07-22 10:56:20,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156060940] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:20,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822367833] [2022-07-22 10:56:20,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:20,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:20,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:20,954 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-22 10:56:20,980 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-22 10:56:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:21,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 10:56:21,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:21,033 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 18 treesize of output 14 [2022-07-22 10:56:21,063 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-22 10:56:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:56:21,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:21,093 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 14 treesize of output 12 [2022-07-22 10:56:21,095 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 22 treesize of output 20 [2022-07-22 10:56:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:56:21,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822367833] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:21,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:21,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-22 10:56:21,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788389529] [2022-07-22 10:56:21,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:21,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 10:56:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:21,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 10:56:21,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-22 10:56:21,110 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:21,182 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-07-22 10:56:21,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 10:56:21,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 10:56:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:21,183 INFO L225 Difference]: With dead ends: 48 [2022-07-22 10:56:21,183 INFO L226 Difference]: Without dead ends: 37 [2022-07-22 10:56:21,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-22 10:56:21,185 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:21,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:56:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-22 10:56:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-22 10:56:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 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-22 10:56:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-22 10:56:21,191 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-07-22 10:56:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:21,192 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-22 10:56:21,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-22 10:56:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 10:56:21,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:21,193 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] [2022-07-22 10:56:21,220 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-22 10:56:21,417 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-22 10:56:21,418 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:21,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-07-22 10:56:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:21,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500777102] [2022-07-22 10:56:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:21,472 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-22 10:56:21,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:21,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500777102] [2022-07-22 10:56:21,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500777102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:21,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326689639] [2022-07-22 10:56:21,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:56:21,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:21,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:21,475 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-22 10:56:21,499 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-22 10:56:21,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:56:21,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:56:21,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:56:21,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:56:21,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:56:21,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326689639] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:21,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:21,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:56:21,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026393257] [2022-07-22 10:56:21,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:21,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:56:21,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:21,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:56:21,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:56:21,621 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:21,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:21,723 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-22 10:56:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:56:21,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 10:56:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:21,725 INFO L225 Difference]: With dead ends: 70 [2022-07-22 10:56:21,725 INFO L226 Difference]: Without dead ends: 44 [2022-07-22 10:56:21,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-22 10:56:21,728 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:21,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:56:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-22 10:56:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-22 10:56:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-22 10:56:21,743 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-07-22 10:56:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:21,743 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-22 10:56:21,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-22 10:56:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 10:56:21,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:21,745 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] [2022-07-22 10:56:21,771 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-22 10:56:21,967 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-22 10:56:21,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-07-22 10:56:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:21,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805201024] [2022-07-22 10:56:21,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:56:22,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:22,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805201024] [2022-07-22 10:56:22,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805201024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:22,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291759859] [2022-07-22 10:56:22,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:56:22,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:22,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:22,052 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-22 10:56:22,053 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-22 10:56:22,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:56:22,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:56:22,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:56:22,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:22,149 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-22 10:56:22,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:22,190 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-22 10:56:22,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291759859] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:22,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:22,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:56:22,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927553896] [2022-07-22 10:56:22,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:22,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:56:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:22,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:56:22,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:56:22,193 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:22,279 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-22 10:56:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:56:22,279 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 10:56:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:22,282 INFO L225 Difference]: With dead ends: 39 [2022-07-22 10:56:22,282 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 10:56:22,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:56:22,284 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:22,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:56:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 10:56:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-22 10:56:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-22 10:56:22,292 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-07-22 10:56:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:22,292 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-22 10:56:22,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-22 10:56:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 10:56:22,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:22,295 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] [2022-07-22 10:56:22,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 10:56:22,523 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-22 10:56:22,524 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-07-22 10:56:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:22,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976121135] [2022-07-22 10:56:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:22,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:56:23,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:23,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976121135] [2022-07-22 10:56:23,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976121135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:23,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280753713] [2022-07-22 10:56:23,306 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:56:23,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:23,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:23,307 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-22 10:56:23,345 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-22 10:56:23,375 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:56:23,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:56:23,376 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-22 10:56:23,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:23,390 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-22 10:56:23,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:23,419 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-22 10:56:23,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:23,454 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-22 10:56:23,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:23,664 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 44 treesize of output 27 [2022-07-22 10:56:23,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:23,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:23,811 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 45 treesize of output 35 [2022-07-22 10:56:23,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:56:23,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:23,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:23,960 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-22 10:56:24,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:24,081 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 37 [2022-07-22 10:56:24,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:24,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 52 treesize of output 32 [2022-07-22 10:56:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:56:24,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:25,139 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-22 10:56:25,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 260 treesize of output 120 [2022-07-22 10:56:25,190 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 5) .cse0) 1)) (not (= (+ (select v_arrayElimArr_3 .cse1) (- 5)) 1)) (<= (* 6 ~N~0) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse4)))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 5) .cse5) 1)) (not (= (+ (select v_arrayElimArr_3 .cse6) (- 5)) 1)) (<= (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse9)))) (* 6 ~N~0))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:56:25,234 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 5) .cse0) 1)) (not (= (+ (select v_arrayElimArr_3 .cse1) (- 5)) 1)) (<= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse4)))) (* 6 ~N~0))))))) (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 5) .cse5) 1)) (not (= (+ (select v_arrayElimArr_3 .cse6) (- 5)) 1)) (<= (* 6 ~N~0) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse9))))))))))) is different from false [2022-07-22 10:56:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-22 10:56:25,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280753713] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:25,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:25,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 50 [2022-07-22 10:56:25,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492146171] [2022-07-22 10:56:25,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:25,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-22 10:56:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:25,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-22 10:56:25,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1949, Unknown=2, NotChecked=186, Total=2450 [2022-07-22 10:56:25,308 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 10:56:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:28,873 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-07-22 10:56:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-22 10:56:28,873 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-22 10:56:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:28,874 INFO L225 Difference]: With dead ends: 85 [2022-07-22 10:56:28,874 INFO L226 Difference]: Without dead ends: 69 [2022-07-22 10:56:28,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=867, Invalid=4839, Unknown=2, NotChecked=298, Total=6006 [2022-07-22 10:56:28,876 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:28,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 113 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 605 Invalid, 0 Unknown, 124 Unchecked, 0.7s Time] [2022-07-22 10:56:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-22 10:56:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 45. [2022-07-22 10:56:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 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-22 10:56:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-07-22 10:56:28,890 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 27 [2022-07-22 10:56:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:28,891 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-07-22 10:56:28,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 10:56:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-07-22 10:56:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 10:56:28,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:28,892 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] [2022-07-22 10:56:28,921 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-22 10:56:29,115 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-22 10:56:29,116 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:29,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-07-22 10:56:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:29,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491162532] [2022-07-22 10:56:29,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:29,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:56:29,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:29,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491162532] [2022-07-22 10:56:29,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491162532] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:29,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300609478] [2022-07-22 10:56:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:29,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:29,241 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-22 10:56:29,242 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-22 10:56:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:29,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 10:56:29,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:29,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 10:56:29,334 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:56:29,334 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 25 treesize of output 24 [2022-07-22 10:56:29,352 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 19 treesize of output 7 [2022-07-22 10:56:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:56:29,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:29,396 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 14 [2022-07-22 10:56:29,398 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 28 treesize of output 24 [2022-07-22 10:56:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:56:29,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300609478] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:29,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:29,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-22 10:56:29,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035191416] [2022-07-22 10:56:29,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:29,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 10:56:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:29,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 10:56:29,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-22 10:56:29,413 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-22 10:56:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:29,601 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-07-22 10:56:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 10:56:29,601 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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 27 [2022-07-22 10:56:29,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:29,602 INFO L225 Difference]: With dead ends: 62 [2022-07-22 10:56:29,602 INFO L226 Difference]: Without dead ends: 49 [2022-07-22 10:56:29,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2022-07-22 10:56:29,603 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:29,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 45 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:56:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-22 10:56:29,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-07-22 10:56:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-22 10:56:29,612 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 27 [2022-07-22 10:56:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:29,612 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-22 10:56:29,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-22 10:56:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-22 10:56:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 10:56:29,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:29,614 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] [2022-07-22 10:56:29,638 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-22 10:56:29,837 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-22 10:56:29,838 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:29,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-07-22 10:56:29,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:29,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216319197] [2022-07-22 10:56:29,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:29,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:29,921 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-22 10:56:29,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:29,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216319197] [2022-07-22 10:56:29,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216319197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:29,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602603005] [2022-07-22 10:56:29,922 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:56:29,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:29,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:29,928 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-22 10:56:29,955 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-22 10:56:30,020 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 10:56:30,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:56:30,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:56:30,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:30,077 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-22 10:56:30,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:30,132 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-22 10:56:30,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602603005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:30,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:30,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:56:30,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259223288] [2022-07-22 10:56:30,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:30,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:56:30,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:30,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:56:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:56:30,135 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:30,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:30,252 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-07-22 10:56:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:56:30,253 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-22 10:56:30,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:30,253 INFO L225 Difference]: With dead ends: 72 [2022-07-22 10:56:30,253 INFO L226 Difference]: Without dead ends: 43 [2022-07-22 10:56:30,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 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-22 10:56:30,254 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:30,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 31 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:56:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-22 10:56:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-07-22 10:56:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-22 10:56:30,261 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-07-22 10:56:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:30,261 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-22 10:56:30,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-22 10:56:30,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:56:30,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:30,262 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:56:30,287 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-22 10:56:30,475 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-22 10:56:30,476 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:30,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:30,476 INFO L85 PathProgramCache]: Analyzing trace with hash -863925553, now seen corresponding path program 6 times [2022-07-22 10:56:30,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:30,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143713765] [2022-07-22 10:56:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:30,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:56:30,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:30,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143713765] [2022-07-22 10:56:30,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143713765] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:30,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720912879] [2022-07-22 10:56:30,554 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:56:30,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:30,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:30,560 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-22 10:56:30,562 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-22 10:56:30,626 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-22 10:56:30,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:56:30,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:56:30,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:56:30,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:56:30,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720912879] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:30,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:30,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:56:30,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812580146] [2022-07-22 10:56:30,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:30,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:56:30,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:30,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:56:30,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:56:30,730 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-22 10:56:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:30,857 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-22 10:56:30,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 10:56:30,857 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 10:56:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:30,858 INFO L225 Difference]: With dead ends: 42 [2022-07-22 10:56:30,858 INFO L226 Difference]: Without dead ends: 38 [2022-07-22 10:56:30,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 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-22 10:56:30,859 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:30,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 33 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:56:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-22 10:56:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-22 10:56:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-22 10:56:30,866 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-07-22 10:56:30,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:30,866 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-22 10:56:30,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-22 10:56:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-22 10:56:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 10:56:30,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:30,867 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] [2022-07-22 10:56:30,885 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-22 10:56:31,071 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-22 10:56:31,072 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-07-22 10:56:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:31,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846249974] [2022-07-22 10:56:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:31,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:56:32,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:32,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846249974] [2022-07-22 10:56:32,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846249974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:32,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609588054] [2022-07-22 10:56:32,268 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:56:32,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:32,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:32,272 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-22 10:56:32,298 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-22 10:56:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:32,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-22 10:56:32,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:32,356 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-22 10:56:32,360 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 11 treesize of output 7 [2022-07-22 10:56:32,375 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-22 10:56:32,406 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-22 10:56:32,445 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-22 10:56:32,631 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 44 treesize of output 27 [2022-07-22 10:56:32,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:32,774 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 37 [2022-07-22 10:56:32,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:32,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:32,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:32,947 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 54 treesize of output 47 [2022-07-22 10:56:33,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:33,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:56:33,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:33,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:33,083 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-22 10:56:33,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:33,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:33,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:33,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:56:33,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:33,188 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-22 10:56:33,294 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 58 treesize of output 47 [2022-07-22 10:56:33,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 65 treesize of output 37 [2022-07-22 10:56:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:56:33,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:35,595 INFO L356 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2022-07-22 10:56:35,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 429 treesize of output 149 [2022-07-22 10:56:35,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 6 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3 .cse4)))))) (not (= (+ (- 5) (select v_arrayElimArr_4 .cse5)) 1)) (not (= (select v_arrayElimArr_4 .cse6) 6)) (not (= (+ .cse0 (- 5)) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:56:35,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 6 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3 .cse4)))))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ (- 5) (select v_arrayElimArr_4 .cse5)) 1)) (not (= (select v_arrayElimArr_4 .cse6) 6)) (not (= (+ .cse0 (- 5)) 1))))) is different from false [2022-07-22 10:56:35,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 6 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3 .cse4)))))) (not (= (+ (- 5) (select v_arrayElimArr_4 .cse5)) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (select v_arrayElimArr_4 .cse6) 6)) (not (= (+ .cse0 (- 5)) 1)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 10:56:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-22 10:56:35,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609588054] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:35,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:35,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 66 [2022-07-22 10:56:35,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915233139] [2022-07-22 10:56:35,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:35,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-22 10:56:35,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:35,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-22 10:56:35,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=3427, Unknown=3, NotChecked=372, Total=4290 [2022-07-22 10:56:35,752 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 66 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 0 states have call successors, (0), 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-22 10:56:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:49,051 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-07-22 10:56:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-22 10:56:49,051 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-22 10:56:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:49,052 INFO L225 Difference]: With dead ends: 100 [2022-07-22 10:56:49,052 INFO L226 Difference]: Without dead ends: 82 [2022-07-22 10:56:49,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3347 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=1212, Invalid=8499, Unknown=3, NotChecked=588, Total=10302 [2022-07-22 10:56:49,056 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:49,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 134 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1074 Invalid, 0 Unknown, 202 Unchecked, 1.3s Time] [2022-07-22 10:56:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-22 10:56:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2022-07-22 10:56:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-22 10:56:49,067 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2022-07-22 10:56:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:49,068 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-22 10:56:49,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 0 states have call successors, (0), 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-22 10:56:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-22 10:56:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 10:56:49,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:49,069 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] [2022-07-22 10:56:49,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 10:56:49,291 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-22 10:56:49,292 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-07-22 10:56:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:49,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017266798] [2022-07-22 10:56:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:56:49,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:49,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017266798] [2022-07-22 10:56:49,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017266798] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:49,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952949333] [2022-07-22 10:56:49,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:56:49,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:49,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:49,463 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-22 10:56:49,466 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-22 10:56:49,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:56:49,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:56:49,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 10:56:49,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:49,573 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 13 treesize of output 9 [2022-07-22 10:56:49,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:49,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 25 treesize of output 24 [2022-07-22 10:56:49,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:49,651 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 25 treesize of output 24 [2022-07-22 10:56:49,671 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-22 10:56:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:56:49,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:49,742 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 14 [2022-07-22 10:56:49,744 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 28 treesize of output 24 [2022-07-22 10:56:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:56:49,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952949333] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:49,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:49,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-07-22 10:56:49,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690993976] [2022-07-22 10:56:49,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:49,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 10:56:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 10:56:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-07-22 10:56:49,774 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:50,124 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-22 10:56:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 10:56:50,124 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-22 10:56:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:50,125 INFO L225 Difference]: With dead ends: 76 [2022-07-22 10:56:50,125 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 10:56:50,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 10:56:50,126 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:50,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 80 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:56:50,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 10:56:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-07-22 10:56:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 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-22 10:56:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-22 10:56:50,136 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-07-22 10:56:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:50,136 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-22 10:56:50,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-22 10:56:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 10:56:50,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:50,137 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] [2022-07-22 10:56:50,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 10:56:50,339 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-22 10:56:50,339 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-07-22 10:56:50,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:50,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233660277] [2022-07-22 10:56:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:56:50,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:50,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233660277] [2022-07-22 10:56:50,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233660277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:50,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798124586] [2022-07-22 10:56:50,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:56:50,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:50,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:50,419 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-22 10:56:50,420 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-22 10:56:50,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:56:50,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:56:50,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:56:50,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:56:50,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:56:50,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798124586] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:50,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:50,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:56:50,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951874331] [2022-07-22 10:56:50,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:50,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:56:50,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:50,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:56:50,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:56:50,596 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:50,738 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-22 10:56:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 10:56:50,739 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-22 10:56:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:50,739 INFO L225 Difference]: With dead ends: 86 [2022-07-22 10:56:50,739 INFO L226 Difference]: Without dead ends: 50 [2022-07-22 10:56:50,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-22 10:56:50,740 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 98 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:50,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 30 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:56:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-22 10:56:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-07-22 10:56:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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-22 10:56:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-22 10:56:50,749 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-07-22 10:56:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:50,750 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-22 10:56:50,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:56:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-22 10:56:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 10:56:50,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:50,751 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:56:50,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-22 10:56:50,955 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-22 10:56:50,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:50,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:50,956 INFO L85 PathProgramCache]: Analyzing trace with hash 975408915, now seen corresponding path program 9 times [2022-07-22 10:56:50,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:50,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027171549] [2022-07-22 10:56:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:50,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:56:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:51,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027171549] [2022-07-22 10:56:51,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027171549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:51,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4497859] [2022-07-22 10:56:51,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:56:51,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:51,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:51,045 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-22 10:56:51,071 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-22 10:56:51,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 10:56:51,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:56:51,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:56:51,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 10:56:51,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:56:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 10:56:51,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4497859] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:56:51,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:56:51,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:56:51,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609606175] [2022-07-22 10:56:51,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:56:51,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:56:51,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:56:51,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:56:51,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:56:51,276 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 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-22 10:56:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:56:51,435 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-22 10:56:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:56:51,435 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 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) Word has length 39 [2022-07-22 10:56:51,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:56:51,436 INFO L225 Difference]: With dead ends: 49 [2022-07-22 10:56:51,436 INFO L226 Difference]: Without dead ends: 45 [2022-07-22 10:56:51,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 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-22 10:56:51,437 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:56:51,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 30 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:56:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-22 10:56:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-22 10:56:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 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-22 10:56:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-22 10:56:51,443 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-07-22 10:56:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:56:51,443 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-22 10:56:51,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 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-22 10:56:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-22 10:56:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 10:56:51,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:56:51,444 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] [2022-07-22 10:56:51,462 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-22 10:56:51,651 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-22 10:56:51,651 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:56:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:56:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-07-22 10:56:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:56:51,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905425549] [2022-07-22 10:56:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:56:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:56:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:56:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:56:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:56:53,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905425549] [2022-07-22 10:56:53,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905425549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:56:53,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933138765] [2022-07-22 10:56:53,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:56:53,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:56:53,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:56:53,018 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-22 10:56:53,019 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-22 10:56:53,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:56:53,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:56:53,084 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-22 10:56:53,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:56:53,094 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-22 10:56:53,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,129 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-22 10:56:53,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,173 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-22 10:56:53,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,238 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-22 10:56:53,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,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-22 10:56:53,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,474 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 44 treesize of output 27 [2022-07-22 10:56:53,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,622 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 37 [2022-07-22 10:56:53,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,807 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 62 treesize of output 51 [2022-07-22 10:56:53,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:53,997 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 61 [2022-07-22 10:56:54,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:56:54,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,181 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 69 treesize of output 65 [2022-07-22 10:56:54,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:56:54,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,336 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 76 treesize of output 70 [2022-07-22 10:56:54,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:56:54,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,508 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 83 treesize of output 73 [2022-07-22 10:56:54,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,676 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-22 10:56:54,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:56:54,785 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 72 treesize of output 40 [2022-07-22 10:56:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:56:54,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:02,441 INFO L356 Elim1Store]: treesize reduction 233, result has 14.3 percent of original size [2022-07-22 10:57:02,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 2288 treesize of output 520 [2022-07-22 10:57:02,540 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 5) .cse0) 1)) (<= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse0 .cse5)))))) (* 6 ~N~0)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= 6 (select v_arrayElimArr_5 .cse6))) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 5)) 1))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse15 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 5) .cse9) 1)) (<= (* 6 ~N~0) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse9 .cse14))))))) (not (= (select v_arrayElimArr_5 .cse17) 6)) (not (= 6 (select v_arrayElimArr_5 .cse15))) (not (= (+ (select v_arrayElimArr_5 .cse16) (- 5)) 1))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:57:02,632 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 5) .cse0) 1)) (<= (* 6 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse0 .cse5))))))) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= 6 (select v_arrayElimArr_5 .cse6))) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 5)) 1))))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)))) (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse15 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 5) .cse9) 1)) (<= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse9 .cse14)))))) (* 6 ~N~0)) (not (= (select v_arrayElimArr_5 .cse17) 6)) (not (= 6 (select v_arrayElimArr_5 .cse15))) (not (= (+ (select v_arrayElimArr_5 .cse16) (- 5)) 1)))))))) is different from false [2022-07-22 10:57:04,856 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 5) .cse0) 1)) (<= (* 6 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse0 .cse5))))))) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= 6 (select v_arrayElimArr_5 .cse6))) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 5)) 1))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse15 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 5) .cse9) 1)) (<= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse9 .cse14)))))) (* 6 ~N~0)) (not (= (select v_arrayElimArr_5 .cse17) 6)) (not (= 6 (select v_arrayElimArr_5 .cse15))) (not (= (+ (select v_arrayElimArr_5 .cse16) (- 5)) 1))))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 10:57:07,098 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 5) .cse0) 1)) (<= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse0 .cse5)))))) (* 6 ~N~0)) (not (= (select v_arrayElimArr_5 .cse8) 6)) (not (= 6 (select v_arrayElimArr_5 .cse6))) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 5)) 1))))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) (forall ((~N~0 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse15 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 5) .cse9) 1)) (<= (* 6 ~N~0) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse9 .cse14))))))) (not (= (select v_arrayElimArr_5 .cse17) 6)) (not (= 6 (select v_arrayElimArr_5 .cse15))) (not (= (+ (select v_arrayElimArr_5 .cse16) (- 5)) 1))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 10:57:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-22 10:57:07,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933138765] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:07,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:07,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 86 [2022-07-22 10:57:07,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655250752] [2022-07-22 10:57:07,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:07,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-22 10:57:07,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:07,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-22 10:57:07,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=5939, Unknown=4, NotChecked=652, Total=7310 [2022-07-22 10:57:07,249 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 86 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:17,988 WARN L233 SmtUtils]: Spent 9.69s on a formula simplification. DAG size of input: 233 DAG size of output: 175 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:58:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:58:20,314 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2022-07-22 10:58:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-07-22 10:58:20,315 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-22 10:58:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:58:20,315 INFO L225 Difference]: With dead ends: 114 [2022-07-22 10:58:20,315 INFO L226 Difference]: Without dead ends: 94 [2022-07-22 10:58:20,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 125 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5047 ImplicationChecksByTransitivity, 81.5s TimeCoverageRelationStatistics Valid=1501, Invalid=13517, Unknown=4, NotChecked=980, Total=16002 [2022-07-22 10:58:20,319 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 118 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:58:20,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 153 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1490 Invalid, 0 Unknown, 319 Unchecked, 4.3s Time] [2022-07-22 10:58:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-22 10:58:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 65. [2022-07-22 10:58:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-22 10:58:20,335 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 41 [2022-07-22 10:58:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:58:20,335 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-22 10:58:20,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:58:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-22 10:58:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 10:58:20,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:58:20,336 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:58:20,352 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-22 10:58:20,536 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-22 10:58:20,537 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:58:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:58:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash 97262195, now seen corresponding path program 3 times [2022-07-22 10:58:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:58:20,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240872035] [2022-07-22 10:58:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:58:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:58:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:58:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 10:58:21,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:58:21,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240872035] [2022-07-22 10:58:21,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240872035] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:58:21,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611134724] [2022-07-22 10:58:21,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:58:21,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:58:21,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:58:21,040 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-22 10:58:21,041 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-22 10:58:21,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 10:58:21,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:58:21,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 10:58:21,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:58:21,213 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-22 10:58:21,479 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-22 10:58:21,479 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 26 [2022-07-22 10:58:21,590 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-22 10:58:21,591 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-22 10:58:21,745 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-22 10:58:21,746 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 40 treesize of output 47 [2022-07-22 10:58:21,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:58:21,939 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 36 treesize of output 36 [2022-07-22 10:58:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:58:22,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:59:23,180 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 25 treesize of output 23 [2022-07-22 10:59:23,186 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 92 treesize of output 86 [2022-07-22 10:59:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 20 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:59:23,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611134724] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:59:23,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:59:23,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 17] total 48 [2022-07-22 10:59:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895710487] [2022-07-22 10:59:23,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:59:23,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-22 10:59:23,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:59:23,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-22 10:59:23,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1815, Unknown=16, NotChecked=0, Total=2256 [2022-07-22 10:59:23,203 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 48 states have internal predecessors, (94), 0 states have call successors, (0), 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-22 10:59:44,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:59:44,369 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-07-22 10:59:44,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-22 10:59:44,370 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 48 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-22 10:59:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:59:44,370 INFO L225 Difference]: With dead ends: 96 [2022-07-22 10:59:44,370 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 10:59:44,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 82.1s TimeCoverageRelationStatistics Valid=935, Invalid=4447, Unknown=20, NotChecked=0, Total=5402 [2022-07-22 10:59:44,372 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 10:59:44,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 61 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 298 Invalid, 0 Unknown, 164 Unchecked, 0.4s Time] [2022-07-22 10:59:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 10:59:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-07-22 10:59:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 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-22 10:59:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-22 10:59:44,387 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 41 [2022-07-22 10:59:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:59:44,387 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-22 10:59:44,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 48 states have internal predecessors, (94), 0 states have call successors, (0), 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-22 10:59:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-22 10:59:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 10:59:44,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:59:44,388 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:59:44,406 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-22 10:59:44,594 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-22 10:59:44,594 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:59:44,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:59:44,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1027067351, now seen corresponding path program 11 times [2022-07-22 10:59:44,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:59:44,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744662964] [2022-07-22 10:59:44,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:59:44,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:59:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:59:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:59:44,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:59:44,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744662964] [2022-07-22 10:59:44,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744662964] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:59:44,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413855292] [2022-07-22 10:59:44,852 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:59:44,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:59:44,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:59:44,854 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-22 10:59:44,854 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-22 10:59:45,015 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-22 10:59:45,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:59:45,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 10:59:45,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:59:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:59:45,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:59:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:59:45,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413855292] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:59:45,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:59:45,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-22 10:59:45,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541814402] [2022-07-22 10:59:45,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:59:45,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 10:59:45,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:59:45,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 10:59:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:59:45,452 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:59:45,852 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-07-22 10:59:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:59:45,852 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-22 10:59:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:59:45,853 INFO L225 Difference]: With dead ends: 109 [2022-07-22 10:59:45,853 INFO L226 Difference]: Without dead ends: 62 [2022-07-22 10:59:45,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-22 10:59:45,854 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 143 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:59:45,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 32 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 10:59:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-22 10:59:45,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-07-22 10:59:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-22 10:59:45,866 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-07-22 10:59:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:59:45,866 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-22 10:59:45,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-22 10:59:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 10:59:45,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:59:45,867 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:59:45,888 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-22 10:59:46,079 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-22 10:59:46,079 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:59:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:59:46,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1824213007, now seen corresponding path program 12 times [2022-07-22 10:59:46,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:59:46,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629637786] [2022-07-22 10:59:46,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:59:46,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:59:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:59:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 10:59:46,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:59:46,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629637786] [2022-07-22 10:59:46,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629637786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:59:46,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449508274] [2022-07-22 10:59:46,304 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:59:46,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:59:46,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:59:46,305 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-22 10:59:46,306 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-22 10:59:46,420 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-22 10:59:46,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:59:46,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 10:59:46,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:59:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:59:46,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:59:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 10:59:46,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449508274] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:59:46,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:59:46,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 21 [2022-07-22 10:59:46,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553590027] [2022-07-22 10:59:46,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:59:46,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 10:59:46,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:59:46,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 10:59:46,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-07-22 10:59:46,850 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 10:59:47,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:59:47,537 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-22 10:59:47,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 10:59:47,538 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 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 46 [2022-07-22 10:59:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:59:47,538 INFO L225 Difference]: With dead ends: 61 [2022-07-22 10:59:47,538 INFO L226 Difference]: Without dead ends: 57 [2022-07-22 10:59:47,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2022-07-22 10:59:47,539 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 10:59:47,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 38 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 10:59:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-22 10:59:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-07-22 10:59:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:59:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-22 10:59:47,548 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2022-07-22 10:59:47,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:59:47,548 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-22 10:59:47,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 10:59:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-22 10:59:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 10:59:47,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:59:47,549 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:59:47,565 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-22 10:59:47,749 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-22 10:59:47,749 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:59:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:59:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash 775276721, now seen corresponding path program 13 times [2022-07-22 10:59:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:59:47,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000644282] [2022-07-22 10:59:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:59:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:59:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:59:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:59:52,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:59:52,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000644282] [2022-07-22 10:59:52,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000644282] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:59:52,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97892060] [2022-07-22 10:59:52,000 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:59:52,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:59:52,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:59:52,002 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-22 10:59:52,003 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-22 10:59:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:59:52,081 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-22 10:59:52,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:59:52,095 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-22 10:59:52,102 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-22 10:59:52,118 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-22 10:59:52,145 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-22 10:59:52,192 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-22 10:59:52,248 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-22 10:59:52,294 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-22 10:59:52,853 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 44 treesize of output 27 [2022-07-22 10:59:53,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:53,223 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 56 treesize of output 42 [2022-07-22 10:59:53,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:53,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:53,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:53,669 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 70 treesize of output 59 [2022-07-22 10:59:54,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,167 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 82 treesize of output 74 [2022-07-22 10:59:54,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:54,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2022-07-22 10:59:55,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:55,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2022-07-22 10:59:55,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:55,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2022-07-22 10:59:55,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:55,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:56,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-07-22 10:59:56,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:59:56,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:59:56,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 88 [2022-07-22 10:59:56,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 73 [2022-07-22 10:59:57,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2022-07-22 10:59:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:59:57,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:00:25,505 INFO L356 Elim1Store]: treesize reduction 420, result has 10.4 percent of original size [2022-07-22 11:00:25,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 5756 treesize of output 1030 [2022-07-22 11:00:26,633 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 6)) (not (= (+ (select v_arrayElimArr_6 .cse1) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_6 .cse2))) (not (= (+ .cse3 (- 5)) 1)) (<= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse3 .cse6 .cse7 .cse8 .cse9))))))) (* 6 ~N~0)) (not (= 6 (select v_arrayElimArr_6 .cse10)))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse21 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse11) 6)) (not (= (+ (select v_arrayElimArr_6 .cse12) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_6 .cse13))) (not (= (+ .cse14 (- 5)) 1)) (<= (* 6 ~N~0) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse17 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse20 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse17 .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) .cse14 .cse17 .cse18 .cse19 .cse20)))))))) (not (= 6 (select v_arrayElimArr_6 .cse21)))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 11:00:28,872 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 6)) (not (= (+ (select v_arrayElimArr_6 .cse1) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_6 .cse2))) (not (= (+ .cse3 (- 5)) 1)) (<= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse3 .cse6 .cse7 .cse8 .cse9))))))) (* 6 ~N~0)) (not (= 6 (select v_arrayElimArr_6 .cse10)))))))) (forall ((~N~0 Int)) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse21 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse11) 6)) (not (= (+ (select v_arrayElimArr_6 .cse12) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_6 .cse13))) (not (= (+ .cse14 (- 5)) 1)) (<= (* 6 ~N~0) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse17 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse20 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse17 .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) .cse14 .cse17 .cse18 .cse19 .cse20)))))))) (not (= 6 (select v_arrayElimArr_6 .cse21)))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))))) is different from false [2022-07-22 11:00:29,296 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 6)) (not (= (+ (select v_arrayElimArr_6 .cse1) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_6 .cse2))) (not (= (+ .cse3 (- 5)) 1)) (<= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse3 .cse6 .cse7 .cse8 .cse9))))))) (* 6 ~N~0)) (not (= 6 (select v_arrayElimArr_6 .cse10)))))))) (forall ((~N~0 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse21 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse11) 6)) (not (= (+ (select v_arrayElimArr_6 .cse12) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_6 .cse13))) (not (= (+ .cse14 (- 5)) 1)) (<= (* 6 ~N~0) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse17 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse20 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse17 .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) .cse14 .cse17 .cse18 .cse19 .cse20)))))))) (not (= 6 (select v_arrayElimArr_6 .cse21)))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 11:00:31,665 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 6)) (not (= (+ (select v_arrayElimArr_6 .cse1) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_6 .cse2))) (not (= (+ .cse3 (- 5)) 1)) (<= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse3 .cse6 .cse7 .cse8 .cse9))))))) (* 6 ~N~0)) (not (= 6 (select v_arrayElimArr_6 .cse10)))))))) (forall ((~N~0 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse21 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse11) 6)) (not (= (+ (select v_arrayElimArr_6 .cse12) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_6 .cse13))) (not (= (+ .cse14 (- 5)) 1)) (<= (* 6 ~N~0) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse17 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse20 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse17 .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) .cse14 .cse17 .cse18 .cse19 .cse20)))))))) (not (= 6 (select v_arrayElimArr_6 .cse21)))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 11:00:32,146 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 6)) (not (= (+ (select v_arrayElimArr_6 .cse1) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_6 .cse2))) (not (= (+ .cse3 (- 5)) 1)) (<= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse3 .cse6 .cse7 .cse8 .cse9))))))) (* 6 ~N~0)) (not (= 6 (select v_arrayElimArr_6 .cse10)))))))) (forall ((~N~0 Int)) (or (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse12 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse21 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse11) 6)) (not (= (+ (select v_arrayElimArr_6 .cse12) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_6 .cse13))) (not (= (+ .cse14 (- 5)) 1)) (<= (* 6 ~N~0) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse17 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse20 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse17 .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse17 .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) .cse14 .cse17 .cse18 .cse19 .cse20)))))))) (not (= 6 (select v_arrayElimArr_6 .cse21)))))) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) is different from false [2022-07-22 11:00:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-22 11:00:32,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97892060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:00:32,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:00:32,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 36] total 99 [2022-07-22 11:00:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729080375] [2022-07-22 11:00:32,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:00:32,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-07-22 11:00:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:00:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-07-22 11:00:32,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=7826, Unknown=5, NotChecked=940, Total=9702 [2022-07-22 11:00:32,368 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 99 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 99 states have internal predecessors, (122), 0 states have call successors, (0), 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-22 11:00:47,246 WARN L233 SmtUtils]: Spent 10.00s on a formula simplification. DAG size of input: 100 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)