./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condm.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/condm.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 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:01:16,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:01:16,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:01:16,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:01:16,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:01:16,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:01:16,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:01:16,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:01:16,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:01:16,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:01:16,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:01:16,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:01:16,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:01:16,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:01:16,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:01:16,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:01:16,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:01:16,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:01:16,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:01:16,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:01:16,292 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:01:16,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:01:16,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:01:16,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:01:16,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:01:16,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:01:16,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:01:16,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:01:16,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:01:16,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:01:16,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:01:16,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:01:16,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:01:16,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:01:16,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:01:16,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:01:16,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:01:16,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:01:16,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:01:16,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:01:16,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:01:16,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:01:16,307 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:01:16,329 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:01:16,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:01:16,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:01:16,330 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:01:16,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:01:16,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:01:16,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:01:16,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:01:16,331 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:01:16,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:01:16,332 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:01:16,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:01:16,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:01:16,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:01:16,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:01:16,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:01:16,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:01:16,333 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:01:16,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:01:16,334 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:01:16,334 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:01:16,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:01:16,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:01:16,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:01:16,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:01:16,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:01:16,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:01:16,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:01:16,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:01:16,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:01:16,336 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:01:16,336 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:01:16,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:01:16,336 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 -> 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d [2022-07-13 11:01:16,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:01:16,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:01:16,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:01:16,512 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:01:16,513 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:01:16,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condm.c [2022-07-13 11:01:16,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d172ff3/b1287ee37fcd4f6f808b97ec22301051/FLAGab14d61d7 [2022-07-13 11:01:16,935 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:01:16,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condm.c [2022-07-13 11:01:16,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d172ff3/b1287ee37fcd4f6f808b97ec22301051/FLAGab14d61d7 [2022-07-13 11:01:16,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d172ff3/b1287ee37fcd4f6f808b97ec22301051 [2022-07-13 11:01:16,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:01:16,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:01:16,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:01:16,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:01:16,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:01:16,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:01:16" (1/1) ... [2022-07-13 11:01:16,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10cf4a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:16, skipping insertion in model container [2022-07-13 11:01:16,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:01:16" (1/1) ... [2022-07-13 11:01:16,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:01:16,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:01:17,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condm.c[588,601] [2022-07-13 11:01:17,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:01:17,113 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:01:17,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condm.c[588,601] [2022-07-13 11:01:17,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:01:17,133 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:01:17,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17 WrapperNode [2022-07-13 11:01:17,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:01:17,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:01:17,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:01:17,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:01:17,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (1/1) ... [2022-07-13 11:01:17,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (1/1) ... [2022-07-13 11:01:17,167 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2022-07-13 11:01:17,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:01:17,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:01:17,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:01:17,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:01:17,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (1/1) ... [2022-07-13 11:01:17,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (1/1) ... [2022-07-13 11:01:17,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (1/1) ... [2022-07-13 11:01:17,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (1/1) ... [2022-07-13 11:01:17,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (1/1) ... [2022-07-13 11:01:17,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (1/1) ... [2022-07-13 11:01:17,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (1/1) ... [2022-07-13 11:01:17,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:01:17,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:01:17,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:01:17,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:01:17,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (1/1) ... [2022-07-13 11:01:17,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:01:17,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:17,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:01:17,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:01:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:01:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:01:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:01:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:01:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:01:17,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:01:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:01:17,291 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:01:17,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:01:17,378 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:01:17,382 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:01:17,382 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 11:01:17,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:01:17 BoogieIcfgContainer [2022-07-13 11:01:17,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:01:17,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:01:17,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:01:17,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:01:17,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:01:16" (1/3) ... [2022-07-13 11:01:17,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e18422e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:01:17, skipping insertion in model container [2022-07-13 11:01:17,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:01:17" (2/3) ... [2022-07-13 11:01:17,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e18422e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:01:17, skipping insertion in model container [2022-07-13 11:01:17,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:01:17" (3/3) ... [2022-07-13 11:01:17,398 INFO L111 eAbstractionObserver]: Analyzing ICFG condm.c [2022-07-13 11:01:17,407 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:01:17,407 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:01:17,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:01:17,458 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@5de33221, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c88047b [2022-07-13 11:01:17,458 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:01:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 11:01:17,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:17,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:17,468 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1828392228, now seen corresponding path program 1 times [2022-07-13 11:01:17,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:17,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390147792] [2022-07-13 11:01:17,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:17,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:17,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390147792] [2022-07-13 11:01:17,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390147792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:01:17,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:01:17,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:01:17,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944157299] [2022-07-13 11:01:17,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:01:17,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:01:17,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:01:17,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:01:17,646 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:17,657 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-13 11:01:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:01:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-13 11:01:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:17,666 INFO L225 Difference]: With dead ends: 40 [2022-07-13 11:01:17,666 INFO L226 Difference]: Without dead ends: 18 [2022-07-13 11:01:17,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:01:17,677 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:17,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:01:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-13 11:01:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-13 11:01:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-13 11:01:17,702 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2022-07-13 11:01:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:17,702 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-13 11:01:17,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-13 11:01:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 11:01:17,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:17,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:17,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:01:17,704 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1148333858, now seen corresponding path program 1 times [2022-07-13 11:01:17,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:17,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052596591] [2022-07-13 11:01:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:17,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:17,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052596591] [2022-07-13 11:01:17,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052596591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:01:17,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:01:17,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:01:17,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817873845] [2022-07-13 11:01:17,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:01:17,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:01:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:17,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:01:17,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:01:17,800 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:17,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:17,846 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-07-13 11:01:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:01:17,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-13 11:01:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:17,847 INFO L225 Difference]: With dead ends: 40 [2022-07-13 11:01:17,847 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 11:01:17,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:01:17,848 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:17,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:01:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 11:01:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-07-13 11:01:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 11:01:17,853 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-07-13 11:01:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:17,853 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 11:01:17,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-13 11:01:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 11:01:17,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:17,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:17,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:01:17,854 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2142875084, now seen corresponding path program 1 times [2022-07-13 11:01:17,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:17,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666692005] [2022-07-13 11:01:17,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:18,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666692005] [2022-07-13 11:01:18,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666692005] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:18,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167267882] [2022-07-13 11:01:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:18,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:18,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:18,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:18,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:01:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:18,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 11:01:18,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:18,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:01:18,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-13 11:01:18,522 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 40 treesize of output 28 [2022-07-13 11:01:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:18,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:19,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-07-13 11:01:19,008 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 32 treesize of output 30 [2022-07-13 11:01:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:19,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167267882] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:01:19,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:01:19,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2022-07-13 11:01:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101905671] [2022-07-13 11:01:19,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:01:19,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:01:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:01:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:01:19,066 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:19,786 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-07-13 11:01:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 11:01:19,787 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-13 11:01:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:19,788 INFO L225 Difference]: With dead ends: 76 [2022-07-13 11:01:19,788 INFO L226 Difference]: Without dead ends: 66 [2022-07-13 11:01:19,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=308, Invalid=814, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 11:01:19,789 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 293 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:19,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 80 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:01:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-13 11:01:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 37. [2022-07-13 11:01:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-07-13 11:01:19,795 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-07-13 11:01:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:19,795 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-07-13 11:01:19,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-07-13 11:01:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:01:19,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:19,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:19,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:01:20,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:20,014 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:20,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:20,015 INFO L85 PathProgramCache]: Analyzing trace with hash -596215012, now seen corresponding path program 1 times [2022-07-13 11:01:20,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:20,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048754217] [2022-07-13 11:01:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:20,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:20,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048754217] [2022-07-13 11:01:20,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048754217] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:20,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240925237] [2022-07-13 11:01:20,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:20,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:20,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:20,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:20,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:01:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:20,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:01:20,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:20,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:20,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240925237] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:01:20,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:01:20,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:01:20,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549384331] [2022-07-13 11:01:20,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:01:20,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:01:20,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:01:20,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:01:20,161 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:20,236 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-07-13 11:01:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:01:20,237 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 11:01:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:20,239 INFO L225 Difference]: With dead ends: 72 [2022-07-13 11:01:20,239 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 11:01:20,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:01:20,243 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:20,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 51 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:01:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 11:01:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2022-07-13 11:01:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-13 11:01:20,255 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 20 [2022-07-13 11:01:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:20,255 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-13 11:01:20,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-07-13 11:01:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:01:20,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:20,256 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:20,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:01:20,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 11:01:20,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:20,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:20,470 INFO L85 PathProgramCache]: Analyzing trace with hash -408404582, now seen corresponding path program 2 times [2022-07-13 11:01:20,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:20,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180897560] [2022-07-13 11:01:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:20,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:01:20,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:20,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180897560] [2022-07-13 11:01:20,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180897560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:20,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465438413] [2022-07-13 11:01:20,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:01:20,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:20,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:20,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:20,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:01:20,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:01:20,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:01:20,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:01:20,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:01:20,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:01:20,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465438413] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:01:20,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:01:20,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2022-07-13 11:01:20,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522293316] [2022-07-13 11:01:20,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:01:20,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:01:20,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:20,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:01:20,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:01:20,932 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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-13 11:01:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:21,231 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-07-13 11:01:21,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 11:01:21,231 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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) Word has length 22 [2022-07-13 11:01:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:21,232 INFO L225 Difference]: With dead ends: 153 [2022-07-13 11:01:21,232 INFO L226 Difference]: Without dead ends: 141 [2022-07-13 11:01:21,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=584, Unknown=0, NotChecked=0, Total=870 [2022-07-13 11:01:21,233 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 541 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:21,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 64 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:01:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-13 11:01:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 42. [2022-07-13 11:01:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 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-13 11:01:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-07-13 11:01:21,238 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 22 [2022-07-13 11:01:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:21,239 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-07-13 11:01:21,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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-13 11:01:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-07-13 11:01:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:01:21,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:21,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:21,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:01:21,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:21,455 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:21,456 INFO L85 PathProgramCache]: Analyzing trace with hash -311207784, now seen corresponding path program 3 times [2022-07-13 11:01:21,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:21,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294954292] [2022-07-13 11:01:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:21,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:21,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294954292] [2022-07-13 11:01:21,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294954292] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:21,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473514134] [2022-07-13 11:01:21,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:01:21,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:21,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:21,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:21,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:01:21,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:01:21,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:01:21,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:01:21,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:01:21,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:01:21,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473514134] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:01:21,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:01:21,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-07-13 11:01:21,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117803233] [2022-07-13 11:01:21,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:01:21,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:01:21,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:21,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:01:21,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:01:21,752 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:22,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:22,339 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-07-13 11:01:22,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 11:01:22,340 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 11:01:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:22,340 INFO L225 Difference]: With dead ends: 112 [2022-07-13 11:01:22,341 INFO L226 Difference]: Without dead ends: 102 [2022-07-13 11:01:22,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=382, Invalid=1258, Unknown=0, NotChecked=0, Total=1640 [2022-07-13 11:01:22,342 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 272 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:22,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 171 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:01:22,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-13 11:01:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 58. [2022-07-13 11:01:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-07-13 11:01:22,359 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 24 [2022-07-13 11:01:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:22,359 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-07-13 11:01:22,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-07-13 11:01:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:01:22,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:22,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:22,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:01:22,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:22,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:22,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:22,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1394926352, now seen corresponding path program 1 times [2022-07-13 11:01:22,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:22,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233613887] [2022-07-13 11:01:22,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:22,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:22,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:22,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233613887] [2022-07-13 11:01:22,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233613887] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:22,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154665356] [2022-07-13 11:01:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:22,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:22,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:22,912 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:22,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:01:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:22,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 11:01:22,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:22,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:01:23,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:23,008 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 21 treesize of output 20 [2022-07-13 11:01:23,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:01:23,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:23,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:01:23,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2022-07-13 11:01:23,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:23,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:01:23,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2022-07-13 11:01:23,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:01:23,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 31 [2022-07-13 11:01:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:23,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:24,604 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 182 treesize of output 170 [2022-07-13 11:01:24,610 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 11:01:24,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 342 [2022-07-13 11:01:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:24,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154665356] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:01:24,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:01:24,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2022-07-13 11:01:24,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475709312] [2022-07-13 11:01:24,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:01:24,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-13 11:01:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:01:24,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-13 11:01:24,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 11:01:24,685 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 40 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:01:33,887 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-07-13 11:01:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-13 11:01:33,888 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-13 11:01:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:01:33,888 INFO L225 Difference]: With dead ends: 136 [2022-07-13 11:01:33,888 INFO L226 Difference]: Without dead ends: 134 [2022-07-13 11:01:33,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2656 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1328, Invalid=7044, Unknown=0, NotChecked=0, Total=8372 [2022-07-13 11:01:33,891 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 507 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:01:33,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 258 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:01:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-13 11:01:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 62. [2022-07-13 11:01:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-07-13 11:01:33,899 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 26 [2022-07-13 11:01:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:01:33,899 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-07-13 11:01:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:01:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-07-13 11:01:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 11:01:33,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:01:33,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:01:33,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:01:34,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:34,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:01:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:01:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash -562149382, now seen corresponding path program 4 times [2022-07-13 11:01:34,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:01:34,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899060242] [2022-07-13 11:01:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:01:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:01:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:01:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:35,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:01:35,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899060242] [2022-07-13 11:01:35,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899060242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:01:35,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787027511] [2022-07-13 11:01:35,019 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:01:35,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:01:35,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:01:35,021 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:01:35,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:01:35,059 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:01:35,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:01:35,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 11:01:35,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:01:35,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:01:35,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:35,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:01:35,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:35,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:01:35,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:01:35,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:01:35,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-07-13 11:01:35,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:35,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:01:35,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:01:35,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:01:35,341 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 36 treesize of output 24 [2022-07-13 11:01:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:01:35,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:01:51,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_145 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (let ((.cse0 (< c_~N~0 0))) (and (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod c_~N~0 2)) (+ (mod (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (- 2)))) (or (not .cse0) (= (mod c_~N~0 2) 0) (forall ((v_ArrVal_147 Int)) (< (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (or (forall ((v_ArrVal_147 Int)) (let ((.cse1 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse1 2) 0) (not (< .cse1 0))))) .cse0))))) is different from false [2022-07-13 11:01:54,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_67| Int)) (or (forall ((v_ArrVal_145 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (let ((.cse0 (< c_~N~0 0))) (and (or (forall ((v_ArrVal_147 Int)) (< (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not .cse0) (= (mod c_~N~0 2) 0)) (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod c_~N~0 2)) (+ (- 2) (mod (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (or (forall ((v_ArrVal_147 Int)) (let ((.cse1 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse1 2) 0) (not (< .cse1 0))))) .cse0))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_67|)))) is different from false [2022-07-13 11:02:13,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_ArrVal_140 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_67|)) (and (or (<= 0 (+ 1 (div (+ |v_ULTIMATE.start_main_~i~0#1_70| (- 1)) 2))) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (< (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (<= 1 (mod (select (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (let ((.cse2 (select (store (store (let ((.cse3 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse2 0)) (= (mod .cse2 2) 0))))))) is different from false [2022-07-13 11:02:16,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_71|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_ArrVal_140 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (and (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (<= 1 (mod (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) (or (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (< (select (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= 0 (+ 1 (div (+ |v_ULTIMATE.start_main_~i~0#1_70| (- 1)) 2)))) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (let ((.cse2 (select (store (store (let ((.cse3 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse2 0)) (= (mod .cse2 2) 0))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_67|)))))) is different from false [2022-07-13 11:02:16,089 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 72 treesize of output 68 [2022-07-13 11:02:16,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 788 treesize of output 780 [2022-07-13 11:02:16,173 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 74 treesize of output 70 [2022-07-13 11:02:16,176 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 896 treesize of output 888 [2022-07-13 11:02:16,439 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 148 treesize of output 140 [2022-07-13 11:02:16,444 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 823 treesize of output 815 [2022-07-13 11:02:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-13 11:02:16,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787027511] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:02:16,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:02:16,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 16] total 42 [2022-07-13 11:02:16,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878902445] [2022-07-13 11:02:16,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:02:16,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 11:02:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:02:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 11:02:16,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1174, Unknown=18, NotChecked=300, Total=1722 [2022-07-13 11:02:16,492 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:18,512 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 1 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_71|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_ArrVal_140 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (and (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (<= 1 (mod (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) (or (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (< (select (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= 0 (+ 1 (div (+ |v_ULTIMATE.start_main_~i~0#1_70| (- 1)) 2)))) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (let ((.cse2 (select (store (store (let ((.cse3 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse2 0)) (= (mod .cse2 2) 0))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_67|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)) is different from false [2022-07-13 11:02:20,517 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 0) (<= 1 c_~N~0) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 1) |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse0 (* 2 (div c_~N~0 2))) (.cse1 (* c_~N~0 2))) (or (< .cse0 c_~N~0) (<= .cse1 (+ .cse0 |c_ULTIMATE.start_main_~i~0#1| 1)) (<= (+ .cse0 3 |c_ULTIMATE.start_main_~i~0#1|) .cse1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_ArrVal_140 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_67|)) (and (or (<= 0 (+ 1 (div (+ |v_ULTIMATE.start_main_~i~0#1_70| (- 1)) 2))) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (< (select (store (store (let ((.cse2 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (<= 1 (mod (select (store (store (let ((.cse3 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int)) (let ((.cse4 (select (store (store (let ((.cse5 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse4 0)) (= (mod .cse4 2) 0)))))))) is different from false [2022-07-13 11:02:23,970 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ (* 2 (div c_~N~0 2)) 1) c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_67| Int)) (or (forall ((v_ArrVal_145 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (let ((.cse0 (< c_~N~0 0))) (and (or (forall ((v_ArrVal_147 Int)) (< (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not .cse0) (= (mod c_~N~0 2) 0)) (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod c_~N~0 2)) (+ (- 2) (mod (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (or (forall ((v_ArrVal_147 Int)) (let ((.cse1 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse1 2) 0) (not (< .cse1 0))))) .cse0))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_67|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 3 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-13 11:02:25,976 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ (* 2 (div c_~N~0 2)) 1) c_~N~0) (forall ((v_ArrVal_145 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (let ((.cse0 (< c_~N~0 0))) (and (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod c_~N~0 2)) (+ (mod (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (- 2)))) (or (not .cse0) (= (mod c_~N~0 2) 0) (forall ((v_ArrVal_147 Int)) (< (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (or (forall ((v_ArrVal_147 Int)) (let ((.cse1 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse1 2) 0) (not (< .cse1 0))))) .cse0))))) (<= 3 c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-13 11:02:28,018 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ (* 2 (div c_~N~0 2)) 1) c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_67| Int)) (or (forall ((v_ArrVal_145 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (let ((.cse0 (< c_~N~0 0))) (and (or (forall ((v_ArrVal_147 Int)) (< (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not .cse0) (= (mod c_~N~0 2) 0)) (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod c_~N~0 2)) (+ (- 2) (mod (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (or (forall ((v_ArrVal_147 Int)) (let ((.cse1 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse1 2) 0) (not (< .cse1 0))))) .cse0))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_67|)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= 3 c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-13 11:02:30,022 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ (* 2 (div c_~N~0 2)) 1) c_~N~0) (forall ((v_ArrVal_145 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (let ((.cse0 (< c_~N~0 0))) (and (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod c_~N~0 2)) (+ (mod (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (- 2)))) (or (not .cse0) (= (mod c_~N~0 2) 0) (forall ((v_ArrVal_147 Int)) (< (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (or (forall ((v_ArrVal_147 Int)) (let ((.cse1 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse1 2) 0) (not (< .cse1 0))))) .cse0))))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= 3 c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-13 11:02:32,040 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ (* 2 (div c_~N~0 2)) 1) c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (let ((.cse0 (< c_~N~0 0))) (and (or (forall ((v_ArrVal_147 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not .cse0) (= (mod c_~N~0 2) 0)) (or (forall ((v_ArrVal_147 Int)) (let ((.cse1 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse1 2) 0) (not (< .cse1 0))))) .cse0) (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (- 2) (mod c_~N~0 2)))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-13 11:02:32,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:32,370 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2022-07-13 11:02:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-13 11:02:32,371 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 11:02:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:32,371 INFO L225 Difference]: With dead ends: 115 [2022-07-13 11:02:32,371 INFO L226 Difference]: Without dead ends: 113 [2022-07-13 11:02:32,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=492, Invalid=2607, Unknown=25, NotChecked=1298, Total=4422 [2022-07-13 11:02:32,373 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 127 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:32,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 239 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 249 Invalid, 0 Unknown, 341 Unchecked, 0.2s Time] [2022-07-13 11:02:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-13 11:02:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2022-07-13 11:02:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.161764705882353) internal successors, (79), 68 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-13 11:02:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-07-13 11:02:32,382 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 27 [2022-07-13 11:02:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:32,382 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-13 11:02:32,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-07-13 11:02:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 11:02:32,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:32,383 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:32,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:02:32,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:32,602 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:32,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1446324666, now seen corresponding path program 2 times [2022-07-13 11:02:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:02:32,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074485705] [2022-07-13 11:02:32,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:32,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:02:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:02:32,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:02:32,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074485705] [2022-07-13 11:02:32,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074485705] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:02:32,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113338016] [2022-07-13 11:02:32,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:02:32,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:32,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:02:32,666 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:02:32,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:02:32,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:02:32,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:02:32,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:02:32,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:02:32,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:02:32,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113338016] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:02:32,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:02:32,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:02:32,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367352992] [2022-07-13 11:02:32,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:02:32,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:02:32,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:02:32,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:02:32,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:02:32,791 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:02:32,881 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2022-07-13 11:02:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:02:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-13 11:02:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:02:32,882 INFO L225 Difference]: With dead ends: 122 [2022-07-13 11:02:32,882 INFO L226 Difference]: Without dead ends: 88 [2022-07-13 11:02:32,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:02:32,882 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 67 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:02:32,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 61 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:02:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-13 11:02:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2022-07-13 11:02:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-13 11:02:32,891 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 30 [2022-07-13 11:02:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:02:32,892 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-13 11:02:32,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:02:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-13 11:02:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 11:02:32,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:02:32,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:02:32,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:02:33,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:33,108 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:02:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:02:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1857271344, now seen corresponding path program 1 times [2022-07-13 11:02:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:02:33,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543209141] [2022-07-13 11:02:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:02:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:34,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:02:34,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543209141] [2022-07-13 11:02:34,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543209141] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:02:34,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964904725] [2022-07-13 11:02:34,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:02:34,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:02:34,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:02:34,072 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:02:34,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:02:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:02:34,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-13 11:02:34,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:02:34,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:02:34,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:34,169 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 28 treesize of output 27 [2022-07-13 11:02:34,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:34,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:34,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:34,216 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:02:34,216 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 32 treesize of output 34 [2022-07-13 11:02:34,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:02:34,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:34,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:02:34,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2022-07-13 11:02:34,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:34,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:02:34,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:02:34,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 43 [2022-07-13 11:02:34,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:34,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:34,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:02:34,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:02:34,398 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 36 treesize of output 38 [2022-07-13 11:02:34,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:02:34,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 56 [2022-07-13 11:02:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:02:34,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:02:37,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_94|)) (and (forall ((v_ArrVal_207 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse0 (select .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse1 (mod .cse0 2))) (or (and (< .cse0 0) (not (= .cse1 0))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (mod .cse2 2))) (and (or (<= 0 .cse2) (= .cse3 0)) (= .cse1 .cse3))))))))) (forall ((v_ArrVal_207 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse7 (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (< .cse5 0) (not (= (mod .cse5 2) 0)))) (= (mod .cse7 2) 0) (not (< .cse7 0))))))))) is different from false [2022-07-13 11:02:40,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (and (forall ((v_ArrVal_207 Int)) (let ((.cse1 (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse2 (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (< .cse0 0) (not (= (mod .cse0 2) 0)))) (not (< .cse2 0)) (= (mod .cse2 2) 0))))) (forall ((v_ArrVal_207 Int)) (let ((.cse9 (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse6 (select .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse5 (mod .cse6 2))) (or (and (not (= .cse5 0)) (< .cse6 0)) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (mod .cse7 2))) (and (or (<= 0 .cse7) (= .cse8 0)) (= .cse8 .cse5)))))))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_94|)))) is different from false [2022-07-13 11:02:42,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_94|)) (and (forall ((v_ArrVal_207 Int)) (let ((.cse2 (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse0 (select .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= (mod .cse0 2) 0) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (< .cse1 0) (not (= (mod .cse1 2) 0)))) (not (< .cse0 0)))))) (forall ((v_ArrVal_207 Int)) (let ((.cse9 (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse6 (select .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse5 (mod .cse6 2))) (or (and (not (= .cse5 0)) (< .cse6 0)) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (mod .cse8 2))) (and (= .cse7 .cse5) (or (<= 0 .cse8) (= .cse7 0))))))))))))) is different from false [2022-07-13 11:02:45,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_94|)) (and (forall ((v_ArrVal_207 Int)) (let ((.cse1 (store (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (let ((.cse4 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))) .cse6 (+ (select .cse3 .cse6) 1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse2 (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= (mod .cse0 2) 0)) (< .cse0 0))) (not (< .cse2 0)) (= (mod .cse2 2) 0))))) (forall ((v_ArrVal_207 Int)) (let ((.cse11 (store (let ((.cse14 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (let ((.cse13 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse12 .cse13 (+ (select .cse12 .cse13) 1))) .cse15 (+ (select .cse12 .cse15) 1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse7 (select .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse8 (mod .cse7 2))) (or (and (< .cse7 0) (not (= .cse8 0))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (mod .cse10 2))) (and (= .cse8 .cse9) (or (= .cse9 0) (<= 0 .cse10))))))))))))) is different from false [2022-07-13 11:02:51,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (and (forall ((v_ArrVal_207 Int)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse3 (store (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse5 (+ (select .cse6 .cse5) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse4 (select .cse3 .cse5))) (let ((.cse0 (mod .cse4 2))) (or (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (mod .cse2 2))) (and (= .cse0 .cse1) (or (<= 0 .cse2) (= .cse1 0))))) (and (not (= .cse0 0)) (< .cse4 0)))))))) (forall ((v_ArrVal_207 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse9 (store (let ((.cse11 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse10 (+ (select .cse11 .cse10) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse7 (select .cse9 .cse10))) (or (not (< .cse7 0)) (= (mod .cse7 2) 0) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (< .cse8 0) (not (= (mod .cse8 2) 0)))))))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)))))) is different from false [2022-07-13 11:02:56,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)) (and (forall ((v_ArrVal_201 Int) (v_ArrVal_207 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (store (let ((.cse4 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse3 (+ (select .cse4 .cse3) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse0 (select .cse2 .cse3))) (or (not (< .cse0 0)) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= (mod .cse1 2) 0)) (< .cse1 0))) (= (mod .cse0 2) 0)))))) (forall ((v_ArrVal_201 Int) (v_ArrVal_207 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse9 (store (let ((.cse11 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse10 (+ (select .cse11 .cse10) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse6 (select .cse9 .cse10))) (let ((.cse5 (mod .cse6 2))) (or (and (not (= .cse5 0)) (< .cse6 0)) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (mod .cse8 2))) (and (= .cse7 .cse5) (or (= .cse7 0) (<= 0 .cse8)))))))))))))) is different from false [2022-07-13 11:03:36,976 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 628 treesize of output 592 [2022-07-13 11:03:36,986 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 11:03:36,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6018 treesize of output 5882 [2022-07-13 11:03:56,870 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 420 treesize of output 396 [2022-07-13 11:03:56,877 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 11:03:56,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1924 treesize of output 1 [2022-07-13 11:03:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-13 11:03:56,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964904725] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:03:56,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:03:56,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 55 [2022-07-13 11:03:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939304662] [2022-07-13 11:03:56,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:03:56,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-13 11:03:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:03:56,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-13 11:03:56,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2078, Unknown=24, NotChecked=594, Total=2970 [2022-07-13 11:03:56,903 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 55 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 55 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-13 11:03:58,960 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 0) (<= 1 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)) (and (forall ((v_ArrVal_201 Int) (v_ArrVal_207 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (store (let ((.cse4 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse3 (+ (select .cse4 .cse3) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse0 (select .cse2 .cse3))) (or (not (< .cse0 0)) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= (mod .cse1 2) 0)) (< .cse1 0))) (= (mod .cse0 2) 0)))))) (forall ((v_ArrVal_201 Int) (v_ArrVal_207 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse9 (store (let ((.cse11 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse10 (+ (select .cse11 .cse10) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse6 (select .cse9 .cse10))) (let ((.cse5 (mod .cse6 2))) (or (and (not (= .cse5 0)) (< .cse6 0)) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (mod .cse8 2))) (and (= .cse7 .cse5) (or (= .cse7 0) (<= 0 .cse8)))))))))))))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-13 11:04:00,965 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (<= 1 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (and (forall ((v_ArrVal_207 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (store (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse6 (+ (select .cse7 .cse6) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse5 (select .cse4 .cse6))) (let ((.cse1 (mod .cse5 2))) (or (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (mod .cse3 2))) (and (= .cse1 .cse2) (or (<= 0 .cse3) (= .cse2 0))))) (and (not (= .cse1 0)) (< .cse5 0)))))))) (forall ((v_ArrVal_207 Int)) (let ((.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse10 (store (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse11 (+ (select .cse12 .cse11) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse8 (select .cse10 .cse11))) (or (not (< .cse8 0)) (= (mod .cse8 2) 0) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (< .cse9 0) (not (= (mod .cse9 2) 0)))))))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)))))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-13 11:04:05,046 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (or (= (select .cse0 (+ (* c_~N~0 4) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 0) (< 3 c_~N~0)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)) (and (forall ((v_ArrVal_201 Int) (v_ArrVal_207 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse3 (store (let ((.cse5 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse4 (+ (select .cse5 .cse4) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse1 (select .cse3 .cse4))) (or (not (< .cse1 0)) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= (mod .cse2 2) 0)) (< .cse2 0))) (= (mod .cse1 2) 0)))))) (forall ((v_ArrVal_201 Int) (v_ArrVal_207 Int)) (let ((.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse10 (store (let ((.cse12 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse11 (+ (select .cse12 .cse11) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse7 (select .cse10 .cse11))) (let ((.cse6 (mod .cse7 2))) (or (and (not (= .cse6 0)) (< .cse7 0)) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (mod .cse9 2))) (and (= .cse8 .cse6) (or (= .cse8 0) (<= 0 .cse9)))))))))))))) (<= 3 c_~N~0) (or (< 2 |c_ULTIMATE.start_main_~i~0#1|) (and (<= 1 c_~N~0) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:04:07,077 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (or (= (select .cse0 (+ (* c_~N~0 4) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 0) (< 3 c_~N~0)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (and (forall ((v_ArrVal_207 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (store (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse6 (+ (select .cse7 .cse6) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse5 (select .cse4 .cse6))) (let ((.cse1 (mod .cse5 2))) (or (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (mod .cse3 2))) (and (= .cse1 .cse2) (or (<= 0 .cse3) (= .cse2 0))))) (and (not (= .cse1 0)) (< .cse5 0)))))))) (forall ((v_ArrVal_207 Int)) (let ((.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse10 (store (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse11 (+ (select .cse12 .cse11) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse8 (select .cse10 .cse11))) (or (not (< .cse8 0)) (= (mod .cse8 2) 0) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (< .cse9 0) (not (= (mod .cse9 2) 0)))))))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-13 11:05:15,677 WARN L233 SmtUtils]: Spent 1.10m on a formula simplification. DAG size of input: 77 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)