./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condg.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/condg.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:34:29,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:34:29,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:34:29,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:34:29,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:34:29,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:34:29,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:34:29,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:34:29,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:34:29,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:34:29,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:34:29,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:34:29,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:34:29,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:34:29,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:34:29,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:34:29,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:34:29,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:34:29,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:34:29,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:34:29,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:34:29,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:34:29,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:34:29,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:34:29,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:34:29,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:34:29,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:34:29,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:34:29,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:34:29,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:34:29,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:34:29,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:34:29,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:34:29,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:34:29,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:34:29,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:34:29,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:34:29,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:34:29,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:34:29,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:34:29,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:34:29,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 11:34:29,328 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:34:29,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:34:29,329 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:34:29,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:34:29,329 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:34:29,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:34:29,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:34:29,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:34:29,330 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:34:29,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:34:29,331 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:34:29,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:34:29,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:34:29,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:34:29,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:34:29,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:34:29,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:34:29,332 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:34:29,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:34:29,332 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:34:29,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:34:29,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:34:29,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:34:29,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:34:29,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:34:29,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:34:29,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:34:29,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:34:29,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:34:29,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:34:29,335 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:34:29,335 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:34:29,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:34:29,335 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:34:29,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 [2021-12-14 11:34:29,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:34:29,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:34:29,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:34:29,546 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:34:29,546 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:34:29,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condg.c [2021-12-14 11:34:29,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d8b3255/d268c33974a74a83890c0a9ee3bf3959/FLAGd0904b288 [2021-12-14 11:34:29,928 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:34:29,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c [2021-12-14 11:34:29,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d8b3255/d268c33974a74a83890c0a9ee3bf3959/FLAGd0904b288 [2021-12-14 11:34:30,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d8b3255/d268c33974a74a83890c0a9ee3bf3959 [2021-12-14 11:34:30,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:34:30,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:34:30,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:34:30,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:34:30,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:34:30,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e1c4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30, skipping insertion in model container [2021-12-14 11:34:30,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:34:30,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:34:30,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c[588,601] [2021-12-14 11:34:30,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:34:30,538 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:34:30,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c[588,601] [2021-12-14 11:34:30,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:34:30,561 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:34:30,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30 WrapperNode [2021-12-14 11:34:30,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:34:30,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:34:30,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:34:30,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:34:30,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,586 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2021-12-14 11:34:30,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:34:30,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:34:30,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:34:30,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:34:30,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:34:30,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:34:30,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:34:30,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:34:30,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (1/1) ... [2021-12-14 11:34:30,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:34:30,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:34:30,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 11:34:30,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 11:34:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:34:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:34:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 11:34:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 11:34:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 11:34:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:34:30,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:34:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 11:34:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 11:34:30,792 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:34:30,793 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:34:30,904 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:34:30,908 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:34:30,908 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-14 11:34:30,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:34:30 BoogieIcfgContainer [2021-12-14 11:34:30,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:34:30,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:34:30,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:34:30,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:34:30,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:34:30" (1/3) ... [2021-12-14 11:34:30,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cd787a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:34:30, skipping insertion in model container [2021-12-14 11:34:30,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:34:30" (2/3) ... [2021-12-14 11:34:30,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cd787a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:34:30, skipping insertion in model container [2021-12-14 11:34:30,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:34:30" (3/3) ... [2021-12-14 11:34:30,915 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2021-12-14 11:34:30,919 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:34:30,919 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:34:30,950 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:34:30,954 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 11:34:30,955 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:34:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 11:34:30,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:34:30,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:34:30,968 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:34:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:34:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2021-12-14 11:34:30,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:34:30,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801233349] [2021-12-14 11:34:30,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:34:30,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:34:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:34:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:34:31,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:34:31,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801233349] [2021-12-14 11:34:31,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801233349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:34:31,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:34:31,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:34:31,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513512109] [2021-12-14 11:34:31,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:34:31,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:34:31,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:34:31,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:34:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:34:31,139 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:34:31,149 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2021-12-14 11:34:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:34:31,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-14 11:34:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:34:31,155 INFO L225 Difference]: With dead ends: 46 [2021-12-14 11:34:31,156 INFO L226 Difference]: Without dead ends: 21 [2021-12-14 11:34:31,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:34:31,160 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:34:31,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:34:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-14 11:34:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-14 11:34:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-12-14 11:34:31,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2021-12-14 11:34:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:34:31,183 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-14 11:34:31,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-12-14 11:34:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 11:34:31,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:34:31,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:34:31,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:34:31,184 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:34:31,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:34:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2021-12-14 11:34:31,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:34:31,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033071478] [2021-12-14 11:34:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:34:31,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:34:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:34:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:34:31,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:34:31,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033071478] [2021-12-14 11:34:31,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033071478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:34:31,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:34:31,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:34:31,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023225868] [2021-12-14 11:34:31,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:34:31,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:34:31,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:34:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:34:31,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:34:31,243 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:34:31,289 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-12-14 11:34:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:34:31,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-14 11:34:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:34:31,290 INFO L225 Difference]: With dead ends: 48 [2021-12-14 11:34:31,291 INFO L226 Difference]: Without dead ends: 34 [2021-12-14 11:34:31,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:34:31,292 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:34:31,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:34:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-14 11:34:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2021-12-14 11:34:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-14 11:34:31,297 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2021-12-14 11:34:31,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:34:31,297 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-14 11:34:31,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-14 11:34:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 11:34:31,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:34:31,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:34:31,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:34:31,299 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:34:31,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:34:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2021-12-14 11:34:31,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:34:31,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498085247] [2021-12-14 11:34:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:34:31,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:34:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:34:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:34:31,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:34:31,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498085247] [2021-12-14 11:34:31,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498085247] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:34:31,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892940506] [2021-12-14 11:34:31,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:34:31,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:34:31,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:34:31,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:34:31,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 11:34:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:34:31,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 11:34:31,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:34:31,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 11:34:31,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-14 11:34:31,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:34:31,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 20 [2021-12-14 11:34:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:34:32,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:34:32,094 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_44 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_44) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-14 11:34:32,139 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:34:32,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-14 11:34:32,144 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:34:32,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2021-12-14 11:34:32,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-14 11:34:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 11:34:32,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892940506] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:34:32,204 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:34:32,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2021-12-14 11:34:32,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278364796] [2021-12-14 11:34:32,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:34:32,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:34:32,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:34:32,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:34:32,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2021-12-14 11:34:32,207 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:34:32,398 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2021-12-14 11:34:32,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 11:34:32,398 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 11:34:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:34:32,399 INFO L225 Difference]: With dead ends: 56 [2021-12-14 11:34:32,400 INFO L226 Difference]: Without dead ends: 54 [2021-12-14 11:34:32,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=370, Unknown=1, NotChecked=40, Total=506 [2021-12-14 11:34:32,401 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:34:32,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 96 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 158 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2021-12-14 11:34:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-14 11:34:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2021-12-14 11:34:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-14 11:34:32,406 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2021-12-14 11:34:32,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:34:32,407 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-14 11:34:32,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-14 11:34:32,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 11:34:32,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:34:32,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:34:32,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 11:34:32,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:34:32,628 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:34:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:34:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2021-12-14 11:34:32,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:34:32,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898816908] [2021-12-14 11:34:32,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:34:32,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:34:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:34:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:34:32,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:34:32,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898816908] [2021-12-14 11:34:32,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898816908] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:34:32,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439690100] [2021-12-14 11:34:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:34:32,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:34:32,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:34:32,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:34:32,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 11:34:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:34:32,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-14 11:34:32,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:34:33,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:34:33,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 11:34:33,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 11:34:33,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-12-14 11:34:33,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-12-14 11:34:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:34:33,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:34:33,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:34:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:34:33,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439690100] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:34:33,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:34:33,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2021-12-14 11:34:33,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966524538] [2021-12-14 11:34:33,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:34:33,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 11:34:33,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:34:33,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 11:34:33,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-12-14 11:34:33,374 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:34:33,547 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2021-12-14 11:34:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 11:34:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 11:34:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:34:33,549 INFO L225 Difference]: With dead ends: 66 [2021-12-14 11:34:33,549 INFO L226 Difference]: Without dead ends: 56 [2021-12-14 11:34:33,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2021-12-14 11:34:33,550 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:34:33,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2021-12-14 11:34:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-14 11:34:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2021-12-14 11:34:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2021-12-14 11:34:33,556 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 21 [2021-12-14 11:34:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:34:33,556 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2021-12-14 11:34:33,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2021-12-14 11:34:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 11:34:33,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:34:33,557 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:34:33,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-14 11:34:33,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-14 11:34:33,792 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:34:33,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:34:33,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1912499326, now seen corresponding path program 2 times [2021-12-14 11:34:33,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:34:33,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960430945] [2021-12-14 11:34:33,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:34:33,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:34:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:34:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:34:33,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:34:33,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960430945] [2021-12-14 11:34:33,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960430945] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:34:33,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706078388] [2021-12-14 11:34:33,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:34:33,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:34:33,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:34:33,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:34:33,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 11:34:33,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:34:33,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:34:33,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:34:33,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:34:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:34:33,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:34:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:34:34,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706078388] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:34:34,046 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:34:34,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-12-14 11:34:34,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365950558] [2021-12-14 11:34:34,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:34:34,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:34:34,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:34:34,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:34:34,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:34:34,048 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:34:34,226 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2021-12-14 11:34:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 11:34:34,227 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 11:34:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:34:34,228 INFO L225 Difference]: With dead ends: 93 [2021-12-14 11:34:34,228 INFO L226 Difference]: Without dead ends: 55 [2021-12-14 11:34:34,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2021-12-14 11:34:34,229 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 161 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:34:34,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 82 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:34:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-14 11:34:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2021-12-14 11:34:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-12-14 11:34:34,234 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2021-12-14 11:34:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:34:34,234 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-14 11:34:34,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2021-12-14 11:34:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 11:34:34,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:34:34,235 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:34:34,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 11:34:34,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:34:34,457 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:34:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:34:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash 550852762, now seen corresponding path program 1 times [2021-12-14 11:34:34,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:34:34,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076920995] [2021-12-14 11:34:34,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:34:34,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:34:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:34:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 11:34:34,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:34:34,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076920995] [2021-12-14 11:34:34,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076920995] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:34:34,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170297474] [2021-12-14 11:34:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:34:34,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:34:34,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:34:34,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:34:34,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 11:34:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:34:34,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 11:34:34,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:34:34,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:34:34,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:34:34,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-14 11:34:34,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-14 11:34:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 11:34:34,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:34:34,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2021-12-14 11:34:34,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-14 11:34:34,687 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:34:34,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 11:34:34,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-14 11:34:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2021-12-14 11:34:34,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170297474] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:34:34,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:34:34,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2021-12-14 11:34:34,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257898556] [2021-12-14 11:34:34,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:34:34,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:34:34,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:34:34,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:34:34,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2021-12-14 11:34:34,708 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:34:34,766 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2021-12-14 11:34:34,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:34:34,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-14 11:34:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:34:34,767 INFO L225 Difference]: With dead ends: 50 [2021-12-14 11:34:34,767 INFO L226 Difference]: Without dead ends: 40 [2021-12-14 11:34:34,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2021-12-14 11:34:34,768 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:34:34,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2021-12-14 11:34:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-14 11:34:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-12-14 11:34:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2021-12-14 11:34:34,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 28 [2021-12-14 11:34:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:34:34,772 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2021-12-14 11:34:34,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:34:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2021-12-14 11:34:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 11:34:34,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:34:34,773 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:34:34,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-14 11:34:34,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:34:34,991 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:34:34,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:34:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1969107172, now seen corresponding path program 3 times [2021-12-14 11:34:34,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:34:34,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618379507] [2021-12-14 11:34:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:34:34,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:34:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:34:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 11:34:35,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:34:35,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618379507] [2021-12-14 11:34:35,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618379507] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:34:35,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667870452] [2021-12-14 11:34:35,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:34:35,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:34:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:34:35,597 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:34:35,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 11:34:35,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 11:34:35,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:34:35,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-14 11:34:35,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:34:35,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:34:35,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:34:35,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 11:34:35,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:34:35,813 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 11:34:35,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-14 11:34:35,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:34:35,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:34:35,998 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:34:35,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 41 [2021-12-14 11:34:36,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:34:36,112 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-14 11:34:36,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 44 [2021-12-14 11:34:36,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:34:36,497 INFO L354 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2021-12-14 11:34:36,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2021-12-14 11:34:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:34:36,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:35:01,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|) (let ((.cse1 (<= |v_ULTIMATE.start_main_~i~0#1_69| 0)) (.cse2 (<= |v_ULTIMATE.start_main_~i~0#1_72| 0)) (.cse0 (let ((.cse7 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 4)) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))) .cse6))))))) (and (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_69| 1) .cse0) .cse1 .cse2) (or .cse1 .cse2 (<= .cse0 2)))) (< 1 |v_ULTIMATE.start_main_~i~0#1_69|))) is different from false [2021-12-14 11:35:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 11:35:01,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667870452] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:35:01,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:35:01,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 47 [2021-12-14 11:35:01,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611320400] [2021-12-14 11:35:01,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:35:01,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-14 11:35:01,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:35:01,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-14 11:35:01,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1769, Unknown=16, NotChecked=88, Total=2162 [2021-12-14 11:35:01,516 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 47 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:35:05,024 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2021-12-14 11:35:05,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-14 11:35:05,025 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-14 11:35:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:35:05,031 INFO L225 Difference]: With dead ends: 84 [2021-12-14 11:35:05,031 INFO L226 Difference]: Without dead ends: 71 [2021-12-14 11:35:05,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=515, Invalid=3378, Unknown=17, NotChecked=122, Total=4032 [2021-12-14 11:35:05,033 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:35:05,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 113 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 148 Invalid, 0 Unknown, 146 Unchecked, 0.1s Time] [2021-12-14 11:35:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-14 11:35:05,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2021-12-14 11:35:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2021-12-14 11:35:05,038 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 28 [2021-12-14 11:35:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:35:05,038 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2021-12-14 11:35:05,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2021-12-14 11:35:05,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:35:05,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:35:05,039 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:35:05,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 11:35:05,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:05,254 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:35:05,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:35:05,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1202810022, now seen corresponding path program 4 times [2021-12-14 11:35:05,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:35:05,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091961856] [2021-12-14 11:35:05,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:35:05,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:35:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:35:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 11:35:05,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:35:05,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091961856] [2021-12-14 11:35:05,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091961856] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:35:05,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558697914] [2021-12-14 11:35:05,303 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 11:35:05,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:05,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:35:05,332 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:35:05,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 11:35:05,373 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 11:35:05,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:35:05,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:35:05,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:35:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 11:35:05,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:35:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 11:35:05,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558697914] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:35:05,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:35:05,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-14 11:35:05,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654893478] [2021-12-14 11:35:05,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:35:05,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:35:05,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:35:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:35:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:35:05,501 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:35:05,624 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2021-12-14 11:35:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:35:05,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-14 11:35:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:35:05,625 INFO L225 Difference]: With dead ends: 140 [2021-12-14 11:35:05,625 INFO L226 Difference]: Without dead ends: 111 [2021-12-14 11:35:05,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:35:05,626 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 118 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:35:05,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 73 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:35:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-14 11:35:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2021-12-14 11:35:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2021-12-14 11:35:05,633 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 30 [2021-12-14 11:35:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:35:05,633 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2021-12-14 11:35:05,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2021-12-14 11:35:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 11:35:05,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:35:05,634 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:35:05,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 11:35:05,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:05,849 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:35:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:35:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash -736332014, now seen corresponding path program 1 times [2021-12-14 11:35:05,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:35:05,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099672854] [2021-12-14 11:35:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:35:05,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:35:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:35:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:35:06,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:35:06,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099672854] [2021-12-14 11:35:06,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099672854] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:35:06,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209502877] [2021-12-14 11:35:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:35:06,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:06,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:35:06,312 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:35:06,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 11:35:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:35:06,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-14 11:35:06,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:35:06,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:35:06,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:06,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 11:35:06,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:06,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:06,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-14 11:35:06,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:06,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:35:06,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:06,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2021-12-14 11:35:06,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:06,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:06,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2021-12-14 11:35:06,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:06,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:06,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:35:06,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2021-12-14 11:35:06,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:06,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 30 [2021-12-14 11:35:07,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:07,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2021-12-14 11:35:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:35:07,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:35:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:35:08,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209502877] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:35:08,714 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:35:08,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 51 [2021-12-14 11:35:08,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191082804] [2021-12-14 11:35:08,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:35:08,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-14 11:35:08,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:35:08,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-14 11:35:08,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2319, Unknown=0, NotChecked=0, Total=2550 [2021-12-14 11:35:08,716 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 51 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 51 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:35:11,194 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2021-12-14 11:35:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-14 11:35:11,195 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 51 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-14 11:35:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:35:11,195 INFO L225 Difference]: With dead ends: 111 [2021-12-14 11:35:11,195 INFO L226 Difference]: Without dead ends: 92 [2021-12-14 11:35:11,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=563, Invalid=4127, Unknown=2, NotChecked=0, Total=4692 [2021-12-14 11:35:11,197 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:35:11,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 236 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 315 Invalid, 0 Unknown, 332 Unchecked, 0.2s Time] [2021-12-14 11:35:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-14 11:35:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2021-12-14 11:35:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.188235294117647) internal successors, (101), 85 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2021-12-14 11:35:11,207 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 32 [2021-12-14 11:35:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:35:11,208 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2021-12-14 11:35:11,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 51 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2021-12-14 11:35:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 11:35:11,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:35:11,213 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:35:11,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 11:35:11,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:11,430 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:35:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:35:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash -35267436, now seen corresponding path program 1 times [2021-12-14 11:35:11,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:35:11,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433451972] [2021-12-14 11:35:11,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:35:11,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:35:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:35:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 11:35:11,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:35:11,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433451972] [2021-12-14 11:35:11,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433451972] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:35:11,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621859596] [2021-12-14 11:35:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:35:11,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:11,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:35:11,497 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:35:11,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 11:35:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:35:11,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 11:35:11,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:35:11,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:35:11,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:11,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:35:11,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 11:35:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 11:35:11,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:35:11,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2021-12-14 11:35:11,649 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-14 11:35:11,660 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:35:11,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 11:35:11,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-14 11:35:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2021-12-14 11:35:11,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621859596] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:35:11,680 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:35:11,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2021-12-14 11:35:11,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022116813] [2021-12-14 11:35:11,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:35:11,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:35:11,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:35:11,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:35:11,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2021-12-14 11:35:11,682 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:35:11,733 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2021-12-14 11:35:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:35:11,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-14 11:35:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:35:11,734 INFO L225 Difference]: With dead ends: 107 [2021-12-14 11:35:11,734 INFO L226 Difference]: Without dead ends: 74 [2021-12-14 11:35:11,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2021-12-14 11:35:11,735 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:35:11,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2021-12-14 11:35:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-14 11:35:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-12-14 11:35:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2021-12-14 11:35:11,740 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 32 [2021-12-14 11:35:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:35:11,740 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2021-12-14 11:35:11,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2021-12-14 11:35:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 11:35:11,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:35:11,741 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:35:11,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 11:35:11,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 11:35:11,957 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:35:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:35:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash -767176616, now seen corresponding path program 5 times [2021-12-14 11:35:11,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:35:11,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084340391] [2021-12-14 11:35:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:35:11,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:35:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:35:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 11:35:12,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:35:12,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084340391] [2021-12-14 11:35:12,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084340391] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:35:12,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667218442] [2021-12-14 11:35:12,012 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 11:35:12,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:35:12,013 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:35:12,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 11:35:12,074 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-14 11:35:12,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:35:12,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:35:12,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:35:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 11:35:12,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:35:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 11:35:12,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667218442] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:35:12,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:35:12,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-14 11:35:12,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485457194] [2021-12-14 11:35:12,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:35:12,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:35:12,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:35:12,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:35:12,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:35:12,181 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:35:12,310 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2021-12-14 11:35:12,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 11:35:12,311 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 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 32 [2021-12-14 11:35:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:35:12,312 INFO L225 Difference]: With dead ends: 97 [2021-12-14 11:35:12,313 INFO L226 Difference]: Without dead ends: 72 [2021-12-14 11:35:12,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-14 11:35:12,314 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 143 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:35:12,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 64 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:35:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-14 11:35:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 41. [2021-12-14 11:35:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2021-12-14 11:35:12,324 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 32 [2021-12-14 11:35:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:35:12,324 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2021-12-14 11:35:12,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2021-12-14 11:35:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 11:35:12,326 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:35:12,327 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:35:12,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 11:35:12,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:12,541 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:35:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:35:12,541 INFO L85 PathProgramCache]: Analyzing trace with hash -143226682, now seen corresponding path program 2 times [2021-12-14 11:35:12,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:35:12,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003469050] [2021-12-14 11:35:12,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:35:12,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:35:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:35:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 11:35:12,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:35:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003469050] [2021-12-14 11:35:12,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003469050] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:35:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603624771] [2021-12-14 11:35:12,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:35:12,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:12,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:35:12,901 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:35:12,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 11:35:12,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:35:12,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:35:12,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-14 11:35:12,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:35:12,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 11:35:13,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:13,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 11:35:13,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:13,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 11:35:13,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:13,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:35:13,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:13,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:35:13,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:13,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:35:13,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:35:13,205 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:35:13,205 INFO L388 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 [2021-12-14 11:35:13,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:13,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 11:35:13,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:13,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 11:35:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 11:35:13,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:35:15,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_134| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_444 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_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2021-12-14 11:35:21,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_135| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_135| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_134| Int)) (or (= (select (store (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_135| 4)) v_ArrVal_443) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |v_ULTIMATE.start_main_~i~0#1_135| 1)))))) is different from false [2021-12-14 11:35:23,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_135| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_134| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_135| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |v_ULTIMATE.start_main_~i~0#1_135| 1)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_135| 4)) v_ArrVal_443) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2021-12-14 11:35:23,704 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_135| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_134| Int)) (or (= (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_135| 4)) v_ArrVal_443) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |v_ULTIMATE.start_main_~i~0#1_135| 1)) (< |v_ULTIMATE.start_main_~i~0#1_135| 1))) is different from false [2021-12-14 11:35:23,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_135| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_134| Int) (v_ArrVal_436 Int)) (or (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_135| 4)) v_ArrVal_443) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |v_ULTIMATE.start_main_~i~0#1_135| 1)) (< |v_ULTIMATE.start_main_~i~0#1_135| 1))) is different from false [2021-12-14 11:35:23,914 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_142| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_135| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_134| Int) (v_ArrVal_436 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |v_ULTIMATE.start_main_~i~0#1_135| 1)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_135| 4)) v_ArrVal_443) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_135| 1))))) is different from false [2021-12-14 11:35:23,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_135| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_134| Int) (v_ArrVal_436 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_135| 4)) v_ArrVal_443) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |v_ULTIMATE.start_main_~i~0#1_135| 1)) (< |v_ULTIMATE.start_main_~i~0#1_135| 1))) is different from false [2021-12-14 11:35:24,073 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int)) (or (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_135| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_134| Int) (v_ArrVal_436 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |v_ULTIMATE.start_main_~i~0#1_143| 1)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_143| 4)) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_135| 4)) v_ArrVal_443) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |v_ULTIMATE.start_main_~i~0#1_135| 1)) (< |v_ULTIMATE.start_main_~i~0#1_135| 1))) (< |v_ULTIMATE.start_main_~i~0#1_143| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-14 11:35:24,099 INFO L354 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2021-12-14 11:35:24,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 73 [2021-12-14 11:35:24,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2021-12-14 11:35:24,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:35:24,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:35:24,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-14 11:35:24,131 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:35:24,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 176 [2021-12-14 11:35:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 22 not checked. [2021-12-14 11:35:24,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603624771] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:35:24,216 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:35:24,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 42 [2021-12-14 11:35:24,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358962789] [2021-12-14 11:35:24,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:35:24,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-14 11:35:24,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:35:24,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-14 11:35:24,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=947, Unknown=19, NotChecked=568, Total=1722 [2021-12-14 11:35:24,218 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:26,231 WARN L838 $PredicateComparison]: unable to prove that (and (= |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_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int)) (or (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_135| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_134| Int) (v_ArrVal_436 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |v_ULTIMATE.start_main_~i~0#1_143| 1)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_143| 4)) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_135| 4)) v_ArrVal_443) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |v_ULTIMATE.start_main_~i~0#1_135| 1)) (< |v_ULTIMATE.start_main_~i~0#1_135| 1))) (< |v_ULTIMATE.start_main_~i~0#1_143| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-12-14 11:35:28,252 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_142| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_135| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_134| Int) (v_ArrVal_436 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |v_ULTIMATE.start_main_~i~0#1_135| 1)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_142| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_135| 4)) v_ArrVal_443) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_135| 1))))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) is different from false [2021-12-14 11:35:32,338 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_135| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_135| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_134| Int)) (or (= (select (store (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_135| 4)) v_ArrVal_443) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |v_ULTIMATE.start_main_~i~0#1_135| 1)))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 0) (<= 3 c_~N~0)) is different from false [2021-12-14 11:35:34,375 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_134| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_134| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_444 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_134| 4)) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= (+ (div (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 4) 3) c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (= (select .cse0 0) 0))) is different from false [2021-12-14 11:35:34,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:35:34,561 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2021-12-14 11:35:34,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 11:35:34,562 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-14 11:35:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:35:34,562 INFO L225 Difference]: With dead ends: 68 [2021-12-14 11:35:34,562 INFO L226 Difference]: Without dead ends: 66 [2021-12-14 11:35:34,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=365, Invalid=1916, Unknown=23, NotChecked=1236, Total=3540 [2021-12-14 11:35:34,564 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:35:34,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 180 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 251 Invalid, 0 Unknown, 359 Unchecked, 0.1s Time] [2021-12-14 11:35:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-14 11:35:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2021-12-14 11:35:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2021-12-14 11:35:34,567 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 35 [2021-12-14 11:35:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:35:34,567 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2021-12-14 11:35:34,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2021-12-14 11:35:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 11:35:34,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:35:34,568 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:35:34,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 11:35:34,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 11:35:34,779 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:35:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:35:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1631780680, now seen corresponding path program 2 times [2021-12-14 11:35:34,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:35:34,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201980176] [2021-12-14 11:35:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:35:34,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:35:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:35:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 11:35:34,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:35:34,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201980176] [2021-12-14 11:35:34,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201980176] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:35:34,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748687291] [2021-12-14 11:35:34,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:35:34,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:34,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:35:34,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:35:34,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 11:35:34,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:35:34,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:35:34,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-14 11:35:34,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:35:34,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:35:35,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:35,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:35:35,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:35,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:35:35,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 11:35:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 11:35:35,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:35:35,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-14 11:35:35,073 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-14 11:35:35,076 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-14 11:35:35,086 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:35:35,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 11:35:35,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-14 11:35:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2021-12-14 11:35:35,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748687291] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:35:35,111 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:35:35,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2021-12-14 11:35:35,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105143002] [2021-12-14 11:35:35,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:35:35,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 11:35:35,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:35:35,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 11:35:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=119, Unknown=3, NotChecked=72, Total=240 [2021-12-14 11:35:35,113 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:35:35,457 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2021-12-14 11:35:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:35:35,457 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-14 11:35:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:35:35,457 INFO L225 Difference]: With dead ends: 112 [2021-12-14 11:35:35,458 INFO L226 Difference]: Without dead ends: 102 [2021-12-14 11:35:35,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2021-12-14 11:35:35,458 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 121 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:35:35,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 146 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 282 Invalid, 0 Unknown, 190 Unchecked, 0.1s Time] [2021-12-14 11:35:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-14 11:35:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 52. [2021-12-14 11:35:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2021-12-14 11:35:35,462 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2021-12-14 11:35:35,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:35:35,462 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2021-12-14 11:35:35,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2021-12-14 11:35:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 11:35:35,463 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:35:35,463 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:35:35,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-14 11:35:35,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 11:35:35,679 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:35:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:35:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1123059706, now seen corresponding path program 3 times [2021-12-14 11:35:35,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:35:35,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147625063] [2021-12-14 11:35:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:35:35,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:35:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:35:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-14 11:35:35,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:35:35,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147625063] [2021-12-14 11:35:35,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147625063] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:35:35,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460785847] [2021-12-14 11:35:35,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:35:35,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:35:35,734 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:35:35,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 11:35:35,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 11:35:35,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:35:35,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 11:35:35,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:35:35,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:35:35,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 11:35:35,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:35,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-14 11:35:35,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-14 11:35:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 11:35:35,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:35:35,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2021-12-14 11:35:35,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-14 11:35:35,935 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2021-12-14 11:35:35,947 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:35:35,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2021-12-14 11:35:35,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-12-14 11:35:35,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-12-14 11:35:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2021-12-14 11:35:35,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460785847] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:35:35,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:35:35,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 15 [2021-12-14 11:35:35,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350981572] [2021-12-14 11:35:35,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:35:35,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 11:35:35,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:35:35,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 11:35:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=101, Unknown=3, NotChecked=66, Total=210 [2021-12-14 11:35:35,975 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:35:36,267 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2021-12-14 11:35:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:35:36,267 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-14 11:35:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:35:36,267 INFO L225 Difference]: With dead ends: 103 [2021-12-14 11:35:36,267 INFO L226 Difference]: Without dead ends: 93 [2021-12-14 11:35:36,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2021-12-14 11:35:36,268 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 98 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:35:36,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 170 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 303 Invalid, 0 Unknown, 220 Unchecked, 0.1s Time] [2021-12-14 11:35:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-14 11:35:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 49. [2021-12-14 11:35:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2021-12-14 11:35:36,271 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 35 [2021-12-14 11:35:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:35:36,272 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2021-12-14 11:35:36,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:35:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2021-12-14 11:35:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 11:35:36,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:35:36,272 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:35:36,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 11:35:36,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 11:35:36,473 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:35:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:35:36,473 INFO L85 PathProgramCache]: Analyzing trace with hash 651947656, now seen corresponding path program 6 times [2021-12-14 11:35:36,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:35:36,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258467194] [2021-12-14 11:35:36,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:35:36,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:35:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:35:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 11:35:37,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:35:37,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258467194] [2021-12-14 11:35:37,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258467194] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:35:37,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273652937] [2021-12-14 11:35:37,344 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 11:35:37,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:35:37,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:35:37,345 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:35:37,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 11:35:37,432 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-14 11:35:37,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:35:37,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-14 11:35:37,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:35:37,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:35:37,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 11:35:37,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2021-12-14 11:35:37,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-12-14 11:35:37,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2021-12-14 11:35:37,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,859 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-12-14 11:35:37,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 58 [2021-12-14 11:35:37,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:37,969 INFO L354 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2021-12-14 11:35:37,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 65 [2021-12-14 11:35:38,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:38,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2021-12-14 11:35:38,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:38,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:38,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:35:38,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:35:38,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:35:38,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2021-12-14 11:35:38,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 11:35:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 11:35:38,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:35:38,349 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) is different from false [2021-12-14 11:35:38,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0) (<= c_~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_618 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse3))) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse3 4)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) is different from false [2021-12-14 11:35:39,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_191| Int)) (or (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_191| 1)) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_191| 4))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse4)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse4 4)) .cse2 .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_191|) c_~N~0))) is different from false [2021-12-14 11:35:41,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_191| Int)) (or (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_191| 1)) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_191| 4))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse4)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse4 4)) .cse2 .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_191|) c_~N~0))) is different from false [2021-12-14 11:35:45,533 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_191| Int)) (let ((.cse0 (+ 2 |v_ULTIMATE.start_main_~i~0#1_191|))) (or (<= .cse0 (select (select (store (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (* |v_ULTIMATE.start_main_~i~0#1_191| 4))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6)))) (+ .cse3 .cse4 .cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6 4)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (<= |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_191|) (<= .cse0 |c_ULTIMATE.start_main_~i~0#1|)))) (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_191| Int)) (let ((.cse15 (+ 2 |v_ULTIMATE.start_main_~i~0#1_191|))) (or (<= (select (select (store (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (* |v_ULTIMATE.start_main_~i~0#1_191| 4))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)))) (+ .cse10 .cse11 .cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13 4)))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse15) (<= |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_191|) (<= .cse15 |c_ULTIMATE.start_main_~i~0#1|))))) is different from false