./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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-tiling/mbpr3.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 a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 22:21:52,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 22:21:52,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 22:21:52,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 22:21:52,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 22:21:52,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 22:21:52,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 22:21:52,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 22:21:52,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 22:21:52,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 22:21:52,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 22:21:52,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 22:21:52,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 22:21:52,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 22:21:52,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 22:21:52,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 22:21:52,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 22:21:52,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 22:21:52,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 22:21:52,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 22:21:52,205 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 22:21:52,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 22:21:52,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 22:21:52,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 22:21:52,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 22:21:52,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 22:21:52,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 22:21:52,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 22:21:52,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 22:21:52,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 22:21:52,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 22:21:52,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 22:21:52,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 22:21:52,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 22:21:52,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 22:21:52,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 22:21:52,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 22:21:52,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 22:21:52,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 22:21:52,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 22:21:52,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 22:21:52,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 22:21:52,226 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 22:21:52,260 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 22:21:52,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 22:21:52,261 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 22:21:52,261 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 22:21:52,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 22:21:52,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 22:21:52,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 22:21:52,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 22:21:52,263 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 22:21:52,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 22:21:52,264 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 22:21:52,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 22:21:52,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 22:21:52,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 22:21:52,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 22:21:52,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 22:21:52,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 22:21:52,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 22:21:52,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 22:21:52,267 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 22:21:52,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 22:21:52,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 22:21:52,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 22:21:52,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 22:21:52,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:21:52,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 22:21:52,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 22:21:52,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 22:21:52,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 22:21:52,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 22:21:52,269 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 22:21:52,269 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 22:21:52,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 22:21:52,270 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 -> a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 [2022-07-11 22:21:52,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 22:21:52,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 22:21:52,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 22:21:52,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 22:21:52,507 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 22:21:52,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr3.c [2022-07-11 22:21:52,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff58c5eb/1e6cc49f17a5493e9a660b14c5dca77a/FLAG69efe3b41 [2022-07-11 22:21:53,019 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 22:21:53,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c [2022-07-11 22:21:53,027 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff58c5eb/1e6cc49f17a5493e9a660b14c5dca77a/FLAG69efe3b41 [2022-07-11 22:21:53,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff58c5eb/1e6cc49f17a5493e9a660b14c5dca77a [2022-07-11 22:21:53,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 22:21:53,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 22:21:53,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 22:21:53,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 22:21:53,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 22:21:53,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53311a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53, skipping insertion in model container [2022-07-11 22:21:53,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 22:21:53,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 22:21:53,605 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-tiling/mbpr3.c[396,409] [2022-07-11 22:21:53,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:21:53,651 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 22:21:53,665 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-tiling/mbpr3.c[396,409] [2022-07-11 22:21:53,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:21:53,692 INFO L208 MainTranslator]: Completed translation [2022-07-11 22:21:53,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53 WrapperNode [2022-07-11 22:21:53,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 22:21:53,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 22:21:53,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 22:21:53,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 22:21:53,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,733 INFO L137 Inliner]: procedures = 15, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2022-07-11 22:21:53,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 22:21:53,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 22:21:53,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 22:21:53,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 22:21:53,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 22:21:53,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 22:21:53,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 22:21:53,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 22:21:53,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (1/1) ... [2022-07-11 22:21:53,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:21:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:53,802 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-11 22:21:53,804 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-11 22:21:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 22:21:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 22:21:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 22:21:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 22:21:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 22:21:53,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 22:21:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 22:21:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 22:21:53,892 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 22:21:53,894 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 22:21:54,071 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 22:21:54,087 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 22:21:54,088 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-11 22:21:54,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:21:54 BoogieIcfgContainer [2022-07-11 22:21:54,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 22:21:54,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 22:21:54,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 22:21:54,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 22:21:54,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 10:21:53" (1/3) ... [2022-07-11 22:21:54,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190bc529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:21:54, skipping insertion in model container [2022-07-11 22:21:54,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:53" (2/3) ... [2022-07-11 22:21:54,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190bc529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:21:54, skipping insertion in model container [2022-07-11 22:21:54,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:21:54" (3/3) ... [2022-07-11 22:21:54,111 INFO L111 eAbstractionObserver]: Analyzing ICFG mbpr3.c [2022-07-11 22:21:54,124 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 22:21:54,129 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 22:21:54,186 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 22:21:54,192 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@1c41b8c5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52404705 [2022-07-11 22:21:54,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 22:21:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 0 states have call successors, (0), 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-11 22:21:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-11 22:21:54,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:54,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:54,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:54,212 INFO L85 PathProgramCache]: Analyzing trace with hash -565609025, now seen corresponding path program 1 times [2022-07-11 22:21:54,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:54,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470305010] [2022-07-11 22:21:54,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:54,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:54,424 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-11 22:21:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:54,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470305010] [2022-07-11 22:21:54,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470305010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:21:54,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:21:54,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 22:21:54,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735901302] [2022-07-11 22:21:54,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:21:54,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 22:21:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:54,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 22:21:54,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:21:54,476 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 0 states have call successors, (0), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:54,497 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-07-11 22:21:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 22:21:54,500 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-11 22:21:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:54,507 INFO L225 Difference]: With dead ends: 63 [2022-07-11 22:21:54,508 INFO L226 Difference]: Without dead ends: 29 [2022-07-11 22:21:54,514 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-11 22:21:54,519 INFO L413 NwaCegarLoop]: 43 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, 43 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-11 22:21:54,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:21:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-11 22:21:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-11 22:21:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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-11 22:21:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-11 22:21:54,559 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2022-07-11 22:21:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:54,559 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-11 22:21:54,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-07-11 22:21:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-11 22:21:54,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:54,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:54,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 22:21:54,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1539779609, now seen corresponding path program 1 times [2022-07-11 22:21:54,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:54,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202636471] [2022-07-11 22:21:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:54,685 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-11 22:21:54,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:54,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202636471] [2022-07-11 22:21:54,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202636471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:21:54,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:21:54,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 22:21:54,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951835563] [2022-07-11 22:21:54,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:21:54,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 22:21:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:54,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 22:21:54,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 22:21:54,692 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:54,734 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-11 22:21:54,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 22:21:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-11 22:21:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:54,736 INFO L225 Difference]: With dead ends: 38 [2022-07-11 22:21:54,736 INFO L226 Difference]: Without dead ends: 36 [2022-07-11 22:21:54,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:21:54,738 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:54,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:21:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-11 22:21:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-07-11 22:21:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 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-11 22:21:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-07-11 22:21:54,744 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2022-07-11 22:21:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:54,745 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-11 22:21:54,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-07-11 22:21:54,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-11 22:21:54,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:54,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:54,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 22:21:54,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1539720027, now seen corresponding path program 1 times [2022-07-11 22:21:54,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:54,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141290416] [2022-07-11 22:21:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:54,874 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-11 22:21:54,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:54,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141290416] [2022-07-11 22:21:54,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141290416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:21:54,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:21:54,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 22:21:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046274690] [2022-07-11 22:21:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:21:54,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 22:21:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:54,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 22:21:54,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:21:54,878 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:54,957 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-07-11 22:21:54,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 22:21:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-11 22:21:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:54,959 INFO L225 Difference]: With dead ends: 64 [2022-07-11 22:21:54,959 INFO L226 Difference]: Without dead ends: 43 [2022-07-11 22:21:54,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:21:54,961 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:54,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 23 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 22:21:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-11 22:21:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-07-11 22:21:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-07-11 22:21:54,968 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-07-11 22:21:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:54,968 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-11 22:21:54,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-07-11 22:21:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 22:21:54,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:54,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:54,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 22:21:54,970 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:54,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:54,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2048606314, now seen corresponding path program 1 times [2022-07-11 22:21:54,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:54,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815006618] [2022-07-11 22:21:54,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:54,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:21:55,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:55,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815006618] [2022-07-11 22:21:55,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815006618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:21:55,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:21:55,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 22:21:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302022998] [2022-07-11 22:21:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:21:55,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 22:21:55,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:55,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 22:21:55,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:21:55,060 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:55,076 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-07-11 22:21:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 22:21:55,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-11 22:21:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:55,079 INFO L225 Difference]: With dead ends: 49 [2022-07-11 22:21:55,080 INFO L226 Difference]: Without dead ends: 34 [2022-07-11 22:21:55,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:21:55,081 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:55,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:21:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-11 22:21:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-11 22:21:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-11 22:21:55,088 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 29 [2022-07-11 22:21:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:55,089 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-11 22:21:55,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-11 22:21:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 22:21:55,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:55,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:55,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 22:21:55,092 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1853333972, now seen corresponding path program 1 times [2022-07-11 22:21:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:55,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729849940] [2022-07-11 22:21:55,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:55,557 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-11 22:21:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:55,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729849940] [2022-07-11 22:21:55,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729849940] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:55,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499383487] [2022-07-11 22:21:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:55,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:55,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:55,562 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-11 22:21:55,563 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-11 22:21:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:55,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-11 22:21:55,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:21:55,801 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 16 treesize of output 12 [2022-07-11 22:21:55,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:55,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:55,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:55,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-11 22:21:55,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:55,926 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 29 treesize of output 28 [2022-07-11 22:21:55,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:55,983 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 31 treesize of output 23 [2022-07-11 22:21:56,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:56,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:21:56,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:56,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:56,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:56,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:21:56,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2022-07-11 22:21:56,195 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-11 22:21:56,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:21:56,628 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 13 [2022-07-11 22:21:56,635 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 26 [2022-07-11 22:21:56,646 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 31 treesize of output 27 [2022-07-11 22:21:56,657 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 55 treesize of output 51 [2022-07-11 22:21:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 22:21:56,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499383487] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:21:56,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:21:56,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 25 [2022-07-11 22:21:56,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944760580] [2022-07-11 22:21:56,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:21:56,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-11 22:21:56,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:56,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-11 22:21:56,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-07-11 22:21:56,791 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 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-11 22:21:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:57,746 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-07-11 22:21:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-11 22:21:57,747 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 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-11 22:21:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:57,748 INFO L225 Difference]: With dead ends: 113 [2022-07-11 22:21:57,748 INFO L226 Difference]: Without dead ends: 86 [2022-07-11 22:21:57,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=490, Invalid=1490, Unknown=0, NotChecked=0, Total=1980 [2022-07-11 22:21:57,749 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 322 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:57,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 78 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 330 Invalid, 0 Unknown, 1 Unchecked, 0.3s Time] [2022-07-11 22:21:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-11 22:21:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 50. [2022-07-11 22:21:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:21:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-07-11 22:21:57,764 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 29 [2022-07-11 22:21:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:57,765 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-07-11 22:21:57,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 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-11 22:21:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-07-11 22:21:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 22:21:57,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:57,766 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:57,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-11 22:21:57,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:57,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash -166695065, now seen corresponding path program 1 times [2022-07-11 22:21:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:57,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148645335] [2022-07-11 22:21:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:21:58,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:58,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148645335] [2022-07-11 22:21:58,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148645335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:58,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077434418] [2022-07-11 22:21:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:58,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:58,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:58,191 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-11 22:21:58,192 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-11 22:21:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:58,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-11 22:21:58,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:21:58,337 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 16 treesize of output 12 [2022-07-11 22:21:58,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:58,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:58,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:58,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-11 22:21:58,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:58,431 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 29 treesize of output 28 [2022-07-11 22:21:58,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:58,447 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 35 treesize of output 23 [2022-07-11 22:21:58,542 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-11 22:21:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 22:21:58,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:21:58,708 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 17 treesize of output 15 [2022-07-11 22:21:58,713 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 34 treesize of output 30 [2022-07-11 22:21:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:21:58,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077434418] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:21:58,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:21:58,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-07-11 22:21:58,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928907399] [2022-07-11 22:21:58,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:21:58,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 22:21:58,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:58,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 22:21:58,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-07-11 22:21:58,767 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 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-11 22:21:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:59,109 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-07-11 22:21:59,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 22:21:59,109 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-11 22:21:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:59,110 INFO L225 Difference]: With dead ends: 97 [2022-07-11 22:21:59,110 INFO L226 Difference]: Without dead ends: 60 [2022-07-11 22:21:59,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-07-11 22:21:59,111 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 169 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:59,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 86 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 22:21:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-11 22:21:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-07-11 22:21:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 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-11 22:21:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-07-11 22:21:59,118 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 35 [2022-07-11 22:21:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:59,118 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-07-11 22:21:59,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 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-11 22:21:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-07-11 22:21:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-11 22:21:59,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:59,125 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:59,154 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-11 22:21:59,334 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,SelfDestructingSolverStorable5 [2022-07-11 22:21:59,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:59,335 INFO L85 PathProgramCache]: Analyzing trace with hash -296121395, now seen corresponding path program 2 times [2022-07-11 22:21:59,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:59,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918629854] [2022-07-11 22:21:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:21:59,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:59,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918629854] [2022-07-11 22:21:59,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918629854] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:59,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473664135] [2022-07-11 22:21:59,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:21:59,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:59,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:59,598 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-11 22:21:59,609 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-11 22:21:59,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:21:59,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:21:59,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 22:21:59,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:22:00,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:22:00,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473664135] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:00,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:00,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2022-07-11 22:22:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344391278] [2022-07-11 22:22:00,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:00,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-11 22:22:00,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:00,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-11 22:22:00,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2022-07-11 22:22:00,222 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 0 states have call successors, (0), 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-11 22:22:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:00,560 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-07-11 22:22:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 22:22:00,561 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 0 states have call successors, (0), 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 47 [2022-07-11 22:22:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:00,562 INFO L225 Difference]: With dead ends: 136 [2022-07-11 22:22:00,562 INFO L226 Difference]: Without dead ends: 69 [2022-07-11 22:22:00,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2022-07-11 22:22:00,564 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 300 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:00,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 132 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 22:22:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-11 22:22:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2022-07-11 22:22:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-07-11 22:22:00,573 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 47 [2022-07-11 22:22:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:00,573 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-07-11 22:22:00,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 0 states have call successors, (0), 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-11 22:22:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-07-11 22:22:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 22:22:00,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:00,574 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:00,603 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-11 22:22:00,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:00,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1825837756, now seen corresponding path program 3 times [2022-07-11 22:22:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:00,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424815249] [2022-07-11 22:22:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:00,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 22:22:01,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:01,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424815249] [2022-07-11 22:22:01,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424815249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:01,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690191605] [2022-07-11 22:22:01,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 22:22:01,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:01,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:01,190 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-11 22:22:01,191 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-11 22:22:01,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-11 22:22:01,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:22:01,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-11 22:22:01,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:01,423 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 16 treesize of output 12 [2022-07-11 22:22:01,454 INFO L356 Elim1Store]: treesize reduction 135, result has 15.6 percent of original size [2022-07-11 22:22:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 40 [2022-07-11 22:22:01,491 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:22:01,492 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 26 treesize of output 25 [2022-07-11 22:22:01,518 INFO L356 Elim1Store]: treesize reduction 162, result has 12.0 percent of original size [2022-07-11 22:22:01,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 37 [2022-07-11 22:22:01,627 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-11 22:22:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-11 22:22:01,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:03,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_73|)) (forall ((v_ArrVal_220 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 12) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_220) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) is different from false [2022-07-11 22:22:03,853 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 41 treesize of output 39 [2022-07-11 22:22:03,860 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 1720 treesize of output 1704 [2022-07-11 22:22:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 1 not checked. [2022-07-11 22:22:04,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690191605] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:04,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:04,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 28 [2022-07-11 22:22:04,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948749248] [2022-07-11 22:22:04,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:04,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-11 22:22:04,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:04,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-11 22:22:04,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=565, Unknown=1, NotChecked=50, Total=756 [2022-07-11 22:22:04,256 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 0 states have call successors, (0), 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-11 22:22:06,400 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_73|)) (forall ((v_ArrVal_220 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 12) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_220) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|))) 0) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)) is different from false [2022-07-11 22:22:08,451 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_73|)) (forall ((v_ArrVal_220 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 12) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_220) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)) 0) (<= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (= (select .cse0 8) 0) (not (= 8 (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)))))) is different from false [2022-07-11 22:22:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:08,584 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-07-11 22:22:08,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 22:22:08,584 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 0 states have call successors, (0), 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 59 [2022-07-11 22:22:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:08,585 INFO L225 Difference]: With dead ends: 88 [2022-07-11 22:22:08,585 INFO L226 Difference]: Without dead ends: 78 [2022-07-11 22:22:08,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=193, Invalid=686, Unknown=3, NotChecked=174, Total=1056 [2022-07-11 22:22:08,586 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 166 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:08,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 174 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 388 Invalid, 0 Unknown, 119 Unchecked, 0.2s Time] [2022-07-11 22:22:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-11 22:22:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2022-07-11 22:22:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 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-11 22:22:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-07-11 22:22:08,594 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 59 [2022-07-11 22:22:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:08,594 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-07-11 22:22:08,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 0 states have call successors, (0), 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-11 22:22:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-07-11 22:22:08,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 22:22:08,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:08,596 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:08,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-11 22:22:08,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:08,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1432810746, now seen corresponding path program 4 times [2022-07-11 22:22:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:08,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268615247] [2022-07-11 22:22:08,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:08,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 22:22:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:09,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268615247] [2022-07-11 22:22:09,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268615247] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:09,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746868600] [2022-07-11 22:22:09,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 22:22:09,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:09,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:09,316 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-11 22:22:09,327 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-11 22:22:09,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 22:22:09,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:22:09,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-11 22:22:09,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:09,496 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 16 treesize of output 12 [2022-07-11 22:22:09,537 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-11 22:22:09,538 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 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-11 22:22:09,593 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:22:09,594 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 26 treesize of output 25 [2022-07-11 22:22:09,621 INFO L356 Elim1Store]: treesize reduction 114, result has 16.2 percent of original size [2022-07-11 22:22:09,621 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 2 case distinctions, treesize of input 34 treesize of output 37 [2022-07-11 22:22:09,670 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-11 22:22:09,671 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 29 treesize of output 28 [2022-07-11 22:22:09,687 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 22:22:09,688 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 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-11 22:22:09,720 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:22:09,725 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 26 treesize of output 25 [2022-07-11 22:22:09,747 INFO L356 Elim1Store]: treesize reduction 114, result has 16.2 percent of original size [2022-07-11 22:22:09,748 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 2 case distinctions, treesize of input 34 treesize of output 37 [2022-07-11 22:22:09,787 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-11 22:22:09,787 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 29 treesize of output 28 [2022-07-11 22:22:09,825 INFO L356 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2022-07-11 22:22:09,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 34 [2022-07-11 22:22:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:10,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:14,865 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 35 treesize of output 31 [2022-07-11 22:22:14,868 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 67 treesize of output 59 [2022-07-11 22:22:14,881 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 17 treesize of output 15 [2022-07-11 22:22:14,884 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 34 treesize of output 30 [2022-07-11 22:22:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:22:15,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746868600] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:15,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:15,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 19] total 40 [2022-07-11 22:22:15,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091231716] [2022-07-11 22:22:15,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:15,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-11 22:22:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:15,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-11 22:22:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1330, Unknown=2, NotChecked=0, Total=1560 [2022-07-11 22:22:15,075 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 40 states, 40 states have (on average 4.2) internal successors, (168), 40 states have internal predecessors, (168), 0 states have call successors, (0), 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-11 22:22:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:17,013 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2022-07-11 22:22:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-11 22:22:17,014 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.2) internal successors, (168), 40 states have internal predecessors, (168), 0 states have call successors, (0), 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 59 [2022-07-11 22:22:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:17,015 INFO L225 Difference]: With dead ends: 196 [2022-07-11 22:22:17,015 INFO L226 Difference]: Without dead ends: 186 [2022-07-11 22:22:17,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 112 SyntacticMatches, 21 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=967, Invalid=5837, Unknown=2, NotChecked=0, Total=6806 [2022-07-11 22:22:17,018 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 398 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:17,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 251 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 771 Invalid, 0 Unknown, 115 Unchecked, 0.6s Time] [2022-07-11 22:22:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-11 22:22:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 138. [2022-07-11 22:22:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.0875912408759123) internal successors, (149), 137 states have internal predecessors, (149), 0 states have call successors, (0), 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-11 22:22:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2022-07-11 22:22:17,034 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 59 [2022-07-11 22:22:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:17,034 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2022-07-11 22:22:17,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.2) internal successors, (168), 40 states have internal predecessors, (168), 0 states have call successors, (0), 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-11 22:22:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2022-07-11 22:22:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-11 22:22:17,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:17,036 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:17,057 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-11 22:22:17,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:17,248 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1827793739, now seen corresponding path program 5 times [2022-07-11 22:22:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:17,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040940482] [2022-07-11 22:22:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-11 22:22:17,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:17,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040940482] [2022-07-11 22:22:17,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040940482] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:17,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501095278] [2022-07-11 22:22:17,433 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 22:22:17,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:17,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:17,440 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-11 22:22:17,441 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-11 22:22:17,785 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 22:22:17,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:22:17,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 22:22:17,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-11 22:22:17,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-11 22:22:18,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501095278] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:18,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:18,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-07-11 22:22:18,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380042866] [2022-07-11 22:22:18,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:18,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 22:22:18,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:18,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 22:22:18,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-07-11 22:22:18,195 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 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-11 22:22:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:18,701 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2022-07-11 22:22:18,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-11 22:22:18,702 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 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 63 [2022-07-11 22:22:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:18,703 INFO L225 Difference]: With dead ends: 259 [2022-07-11 22:22:18,703 INFO L226 Difference]: Without dead ends: 189 [2022-07-11 22:22:18,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2022-07-11 22:22:18,704 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 164 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:18,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 115 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 22:22:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-11 22:22:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 160. [2022-07-11 22:22:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.0817610062893082) internal successors, (172), 159 states have internal predecessors, (172), 0 states have call successors, (0), 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-11 22:22:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2022-07-11 22:22:18,721 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 63 [2022-07-11 22:22:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:18,722 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2022-07-11 22:22:18,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 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-11 22:22:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2022-07-11 22:22:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 22:22:18,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:18,723 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:18,743 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-11 22:22:18,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:18,932 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:18,932 INFO L85 PathProgramCache]: Analyzing trace with hash 757222925, now seen corresponding path program 6 times [2022-07-11 22:22:18,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:18,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769143640] [2022-07-11 22:22:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:18,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:19,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:19,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769143640] [2022-07-11 22:22:19,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769143640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:19,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159925787] [2022-07-11 22:22:19,494 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 22:22:19,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:19,496 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-11 22:22:19,496 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-11 22:22:19,588 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-11 22:22:19,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:22:19,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-11 22:22:19,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:19,699 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 16 treesize of output 12 [2022-07-11 22:22:19,744 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-11 22:22:19,744 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 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-11 22:22:19,812 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:22:19,812 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 26 treesize of output 25 [2022-07-11 22:22:19,832 INFO L356 Elim1Store]: treesize reduction 114, result has 16.2 percent of original size [2022-07-11 22:22:19,833 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 2 case distinctions, treesize of input 34 treesize of output 37 [2022-07-11 22:22:19,871 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-11 22:22:19,871 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 29 treesize of output 28 [2022-07-11 22:22:19,930 INFO L356 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2022-07-11 22:22:19,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 34 [2022-07-11 22:22:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-11 22:22:20,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:20,981 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 35 treesize of output 31 [2022-07-11 22:22:20,984 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 67 treesize of output 59 [2022-07-11 22:22:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 22:22:21,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159925787] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:21,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:21,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 46 [2022-07-11 22:22:21,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002486903] [2022-07-11 22:22:21,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:21,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-11 22:22:21,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-11 22:22:21,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2022-07-11 22:22:21,242 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand has 46 states, 46 states have (on average 3.869565217391304) internal successors, (178), 46 states have internal predecessors, (178), 0 states have call successors, (0), 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-11 22:22:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:27,282 INFO L93 Difference]: Finished difference Result 283 states and 312 transitions. [2022-07-11 22:22:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-07-11 22:22:27,282 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.869565217391304) internal successors, (178), 46 states have internal predecessors, (178), 0 states have call successors, (0), 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 65 [2022-07-11 22:22:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:27,283 INFO L225 Difference]: With dead ends: 283 [2022-07-11 22:22:27,283 INFO L226 Difference]: Without dead ends: 267 [2022-07-11 22:22:27,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 114 SyntacticMatches, 17 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5732 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2534, Invalid=16372, Unknown=0, NotChecked=0, Total=18906 [2022-07-11 22:22:27,288 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1058 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:27,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 310 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 1473 Invalid, 0 Unknown, 120 Unchecked, 1.1s Time] [2022-07-11 22:22:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-11 22:22:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 142. [2022-07-11 22:22:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.0851063829787233) internal successors, (153), 141 states have internal predecessors, (153), 0 states have call successors, (0), 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-11 22:22:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2022-07-11 22:22:27,304 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 65 [2022-07-11 22:22:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:27,305 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2022-07-11 22:22:27,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.869565217391304) internal successors, (178), 46 states have internal predecessors, (178), 0 states have call successors, (0), 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-11 22:22:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2022-07-11 22:22:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-11 22:22:27,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:27,306 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:27,330 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-11 22:22:27,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:27,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:27,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:27,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1229247639, now seen corresponding path program 7 times [2022-07-11 22:22:27,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:27,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186297371] [2022-07-11 22:22:27,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:27,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:28,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:28,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186297371] [2022-07-11 22:22:28,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186297371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:28,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905616440] [2022-07-11 22:22:28,173 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 22:22:28,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:28,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:28,189 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-11 22:22:28,218 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-11 22:22:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:28,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-11 22:22:28,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:28,378 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 16 treesize of output 12 [2022-07-11 22:22:28,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2022-07-11 22:22:28,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,452 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 26 treesize of output 25 [2022-07-11 22:22:28,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-11 22:22:28,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,527 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 26 treesize of output 25 [2022-07-11 22:22:28,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-11 22:22:28,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,586 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 29 treesize of output 28 [2022-07-11 22:22:28,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 31 [2022-07-11 22:22:28,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,628 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 26 treesize of output 25 [2022-07-11 22:22:28,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-11 22:22:28,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,677 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 26 treesize of output 25 [2022-07-11 22:22:28,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-11 22:22:28,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,721 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 29 treesize of output 28 [2022-07-11 22:22:28,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:22:28,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-07-11 22:22:28,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:22:28,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2022-07-11 22:22:28,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:28,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:22:28,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 49 [2022-07-11 22:22:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:29,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:24:43,916 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 145 treesize of output 139 [2022-07-11 22:24:43,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 975 treesize of output 967 [2022-07-11 22:24:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:24:44,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905616440] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:24:44,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:24:44,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 24] total 50 [2022-07-11 22:24:44,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363037364] [2022-07-11 22:24:44,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:24:44,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-11 22:24:44,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:24:44,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-11 22:24:44,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2014, Unknown=89, NotChecked=0, Total=2450 [2022-07-11 22:24:44,191 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand has 50 states, 50 states have (on average 4.1) internal successors, (205), 50 states have internal predecessors, (205), 0 states have call successors, (0), 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-11 22:25:03,487 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (forall ((v_ArrVal_599 Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_580 Int) (v_ArrVal_578 Int) (v_ArrVal_600 Int)) (let ((.cse3 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse2 (+ (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3))) (let ((.cse0 (select (let ((.cse4 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (store (store .cse1 .cse2 v_ArrVal_580) (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_578) (+ .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse4 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (select .cse1 .cse2) v_ArrVal_580)) (= .cse0 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|))))))) (<= 7 |c_ULTIMATE.start_main_~CCCELVOL3~0#1|) (let ((.cse5 (select .cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))) (or (= .cse5 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse5))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_163| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_163|)) (forall ((v_ArrVal_599 Int) (v_ArrVal_575 Int) (v_ArrVal_573 Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_580 Int) (v_ArrVal_567 Int) (v_ArrVal_578 Int) (v_ArrVal_600 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 12 |v_ULTIMATE.start_main_~i~0#1_163|) (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_567)) (.cse9 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12))) (let ((.cse7 (select (let ((.cse10 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (store (store (store (store .cse8 |c_ULTIMATE.start_main_~#volArray~0#1.offset| v_ArrVal_573) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8) v_ArrVal_575) .cse9 v_ArrVal_580) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20) v_ArrVal_578) (+ .cse10 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse10 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) .cse9))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse7) (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_155|)) (not (<= (select .cse8 .cse9) v_ArrVal_580)) (= 0 .cse7))))))) (= |c_ULTIMATE.start_main_~CCCELVOL3~0#1| (select .cse6 12)) (not (= (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 24)))) is different from false [2022-07-11 22:25:07,833 WARN L833 $PredicateComparison]: unable to prove that (and (<= 7 |c_ULTIMATE.start_main_~CCCELVOL3~0#1|) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_155| Int)) (or (forall ((v_ArrVal_599 Int) (v_ArrVal_600 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse1 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|)))) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (= |c_ULTIMATE.start_main_~CCCELVOL3~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 12)) (not (= (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 24))) is different from false [2022-07-11 22:25:21,178 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_599 Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_580 Int) (v_ArrVal_578 Int) (v_ArrVal_600 Int)) (let ((.cse3 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse2 (+ (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3))) (let ((.cse0 (select (let ((.cse4 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (store (store .cse1 .cse2 v_ArrVal_580) (+ (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_578) (+ .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse4 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (select .cse1 .cse2) v_ArrVal_580)) (= .cse0 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|))))))) (<= 7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 12)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_163| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_163|)) (forall ((v_ArrVal_599 Int) (v_ArrVal_575 Int) (v_ArrVal_573 Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_580 Int) (v_ArrVal_567 Int) (v_ArrVal_578 Int) (v_ArrVal_600 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 12 |v_ULTIMATE.start_main_~i~0#1_163|) (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_567)) (.cse7 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12))) (let ((.cse5 (select (let ((.cse8 (* 12 |v_ULTIMATE.start_main_~i~0#1_155|))) (store (store (store (store (store (store .cse6 |c_ULTIMATE.start_main_~#volArray~0#1.offset| v_ArrVal_573) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8) v_ArrVal_575) .cse7 v_ArrVal_580) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20) v_ArrVal_578) (+ .cse8 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_600) (+ .cse8 (- 12) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_599)) .cse7))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse5) (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_155|)) (not (<= (select .cse6 .cse7) v_ArrVal_580)) (= 0 .cse5))))))) (not (= (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 24))) is different from false