./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/nr4.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 3219130777e42bfc39497c312a66c6d1b1af231a6df358861eaa545434d20cb1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 10:09:25,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 10:09:25,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 10:09:25,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 10:09:25,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 10:09:25,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 10:09:25,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 10:09:25,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 10:09:25,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 10:09:25,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 10:09:25,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 10:09:25,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 10:09:25,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 10:09:25,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 10:09:25,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 10:09:25,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 10:09:25,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 10:09:25,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 10:09:25,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 10:09:25,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 10:09:25,886 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 10:09:25,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 10:09:25,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 10:09:25,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 10:09:25,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 10:09:25,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 10:09:25,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 10:09:25,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 10:09:25,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 10:09:25,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 10:09:25,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 10:09:25,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 10:09:25,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 10:09:25,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 10:09:25,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 10:09:25,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 10:09:25,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 10:09:25,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 10:09:25,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 10:09:25,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 10:09:25,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 10:09:25,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 10:09:25,898 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 10:09:25,917 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 10:09:25,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 10:09:25,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 10:09:25,918 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 10:09:25,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 10:09:25,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 10:09:25,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 10:09:25,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 10:09:25,920 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 10:09:25,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 10:09:25,921 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 10:09:25,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 10:09:25,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 10:09:25,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 10:09:25,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 10:09:25,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 10:09:25,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 10:09:25,922 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 10:09:25,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 10:09:25,923 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 10:09:25,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 10:09:25,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 10:09:25,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 10:09:25,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 10:09:25,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:09:25,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 10:09:25,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 10:09:25,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 10:09:25,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 10:09:25,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 10:09:25,924 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 10:09:25,925 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 10:09:25,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 10:09:25,925 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 -> 3219130777e42bfc39497c312a66c6d1b1af231a6df358861eaa545434d20cb1 [2022-07-13 10:09:26,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 10:09:26,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 10:09:26,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 10:09:26,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 10:09:26,127 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 10:09:26,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr4.c [2022-07-13 10:09:26,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68115f3c/6bb838b540c04081b879cf49149960cb/FLAG90fadf1a6 [2022-07-13 10:09:26,565 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 10:09:26,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr4.c [2022-07-13 10:09:26,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68115f3c/6bb838b540c04081b879cf49149960cb/FLAG90fadf1a6 [2022-07-13 10:09:26,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68115f3c/6bb838b540c04081b879cf49149960cb [2022-07-13 10:09:26,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 10:09:26,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 10:09:26,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 10:09:26,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 10:09:26,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 10:09:26,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9b7dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26, skipping insertion in model container [2022-07-13 10:09:26,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 10:09:26,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 10:09:26,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr4.c[394,407] [2022-07-13 10:09:26,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:09:26,765 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 10:09:26,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr4.c[394,407] [2022-07-13 10:09:26,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:09:26,797 INFO L208 MainTranslator]: Completed translation [2022-07-13 10:09:26,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26 WrapperNode [2022-07-13 10:09:26,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 10:09:26,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 10:09:26,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 10:09:26,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 10:09:26,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,836 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-07-13 10:09:26,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 10:09:26,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 10:09:26,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 10:09:26,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 10:09:26,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 10:09:26,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 10:09:26,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 10:09:26,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 10:09:26,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (1/1) ... [2022-07-13 10:09:26,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:09:26,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:09:26,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 10:09:26,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 10:09:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 10:09:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 10:09:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 10:09:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 10:09:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 10:09:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 10:09:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 10:09:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 10:09:26,955 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 10:09:26,956 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 10:09:27,050 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 10:09:27,054 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 10:09:27,054 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 10:09:27,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:09:27 BoogieIcfgContainer [2022-07-13 10:09:27,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 10:09:27,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 10:09:27,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 10:09:27,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 10:09:27,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:09:26" (1/3) ... [2022-07-13 10:09:27,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1127a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:09:27, skipping insertion in model container [2022-07-13 10:09:27,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:09:26" (2/3) ... [2022-07-13 10:09:27,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1127a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:09:27, skipping insertion in model container [2022-07-13 10:09:27,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:09:27" (3/3) ... [2022-07-13 10:09:27,062 INFO L111 eAbstractionObserver]: Analyzing ICFG nr4.c [2022-07-13 10:09:27,077 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 10:09:27,083 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 10:09:27,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 10:09:27,166 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@304e71b4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66f07487 [2022-07-13 10:09:27,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 10:09:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 10:09:27,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:27,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:27,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:27,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-13 10:09:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:27,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309940070] [2022-07-13 10:09:27,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:27,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:27,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:27,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309940070] [2022-07-13 10:09:27,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309940070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:09:27,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:09:27,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 10:09:27,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698693010] [2022-07-13 10:09:27,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:09:27,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 10:09:27,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 10:09:27,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:09:27,379 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:27,395 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-13 10:09:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 10:09:27,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 10:09:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:27,403 INFO L225 Difference]: With dead ends: 45 [2022-07-13 10:09:27,403 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 10:09:27,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:09:27,413 INFO L413 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:27,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 10:09:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 10:09:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-13 10:09:27,442 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-13 10:09:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:27,443 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-13 10:09:27,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-13 10:09:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 10:09:27,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:27,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:27,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 10:09:27,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-13 10:09:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:27,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318100360] [2022-07-13 10:09:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:27,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:27,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318100360] [2022-07-13 10:09:27,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318100360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:09:27,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:09:27,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 10:09:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596987186] [2022-07-13 10:09:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:09:27,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 10:09:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:27,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 10:09:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:09:27,545 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:27,589 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-07-13 10:09:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:09:27,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 10:09:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:27,591 INFO L225 Difference]: With dead ends: 29 [2022-07-13 10:09:27,591 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 10:09:27,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:09:27,592 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:27,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 10:09:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-13 10:09:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-13 10:09:27,601 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-13 10:09:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:27,603 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-13 10:09:27,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-13 10:09:27,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 10:09:27,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:27,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:27,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 10:09:27,604 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:27,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash 274152825, now seen corresponding path program 1 times [2022-07-13 10:09:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:27,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824053835] [2022-07-13 10:09:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:27,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:27,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:27,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824053835] [2022-07-13 10:09:27,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824053835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:09:27,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:09:27,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 10:09:27,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885840163] [2022-07-13 10:09:27,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:09:27,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 10:09:27,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:27,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 10:09:27,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:09:27,766 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:27,808 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-13 10:09:27,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:09:27,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 10:09:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:27,810 INFO L225 Difference]: With dead ends: 38 [2022-07-13 10:09:27,810 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 10:09:27,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 10:09:27,811 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:27,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 10:09:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-13 10:09:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-13 10:09:27,816 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-13 10:09:27,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:27,817 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-13 10:09:27,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-13 10:09:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 10:09:27,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:27,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:27,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 10:09:27,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash -715167033, now seen corresponding path program 1 times [2022-07-13 10:09:27,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:27,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418494657] [2022-07-13 10:09:27,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:27,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:27,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:27,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418494657] [2022-07-13 10:09:27,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418494657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:09:27,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:09:27,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 10:09:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815760297] [2022-07-13 10:09:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:09:27,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 10:09:27,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:27,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 10:09:27,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:09:27,853 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:27,866 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-13 10:09:27,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 10:09:27,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-07-13 10:09:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:27,867 INFO L225 Difference]: With dead ends: 42 [2022-07-13 10:09:27,867 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 10:09:27,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:09:27,869 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:27,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 10:09:27,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-07-13 10:09:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-13 10:09:27,874 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-13 10:09:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:27,874 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-13 10:09:27,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-13 10:09:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 10:09:27,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:27,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:27,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 10:09:27,875 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:27,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1618667584, now seen corresponding path program 1 times [2022-07-13 10:09:27,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:27,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974238369] [2022-07-13 10:09:27,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:27,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:27,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:27,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974238369] [2022-07-13 10:09:27,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974238369] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:09:27,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600605075] [2022-07-13 10:09:27,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:27,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:27,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:09:27,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:09:27,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 10:09:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:27,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 10:09:27,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:09:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:27,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:09:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:28,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600605075] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:09:28,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:09:28,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 10:09:28,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832710111] [2022-07-13 10:09:28,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:09:28,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 10:09:28,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:28,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 10:09:28,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 10:09:28,002 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:28,030 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-07-13 10:09:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 10:09:28,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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) Word has length 19 [2022-07-13 10:09:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:28,031 INFO L225 Difference]: With dead ends: 50 [2022-07-13 10:09:28,031 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 10:09:28,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 10:09:28,032 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:28,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 68 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 10:09:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-13 10:09:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-13 10:09:28,037 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 19 [2022-07-13 10:09:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:28,037 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-13 10:09:28,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-07-13 10:09:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 10:09:28,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:28,038 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:28,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 10:09:28,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:28,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2124634745, now seen corresponding path program 2 times [2022-07-13 10:09:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:28,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304895955] [2022-07-13 10:09:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:28,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:28,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:28,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304895955] [2022-07-13 10:09:28,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304895955] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:09:28,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21707233] [2022-07-13 10:09:28,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:09:28,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:28,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:09:28,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:09:28,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 10:09:28,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:09:28,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:09:28,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 10:09:28,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:09:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:28,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:09:28,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21707233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:09:28,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 10:09:28,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-07-13 10:09:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344383322] [2022-07-13 10:09:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:09:28,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 10:09:28,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:09:28,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 10:09:28,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2022-07-13 10:09:28,430 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:09:28,457 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-07-13 10:09:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 10:09:28,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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) Word has length 28 [2022-07-13 10:09:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:09:28,458 INFO L225 Difference]: With dead ends: 59 [2022-07-13 10:09:28,458 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 10:09:28,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2022-07-13 10:09:28,465 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:09:28,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 24 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:09:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 10:09:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-13 10:09:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-13 10:09:28,479 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2022-07-13 10:09:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:09:28,481 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-13 10:09:28,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:09:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-13 10:09:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 10:09:28,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:09:28,482 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:09:28,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 10:09:28,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 10:09:28,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:09:28,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:09:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1423570167, now seen corresponding path program 1 times [2022-07-13 10:09:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:09:28,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769287315] [2022-07-13 10:09:28,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:09:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:29,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:09:29,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769287315] [2022-07-13 10:09:29,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769287315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:09:29,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753537156] [2022-07-13 10:09:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:09:29,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:09:29,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:09:29,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:09:29,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 10:09:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:09:29,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 10:09:29,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:09:29,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-13 10:09:29,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:09:29,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-07-13 10:09:29,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:09:29,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-13 10:09:29,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:09:29,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-13 10:09:29,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 10:09:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:09:29,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:10:00,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_21| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_20| Int) (v_ArrVal_64 Int) (v_ArrVal_62 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_21| (- 4))) v_ArrVal_62) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_20| (- 4))) v_ArrVal_64)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_20| 1) |v_ULTIMATE.start_main_~j~0#1_21|)))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_21| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-13 10:10:24,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-07-13 10:10:24,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 848 treesize of output 844 [2022-07-13 10:10:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-13 10:10:26,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753537156] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:10:26,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:10:26,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 14] total 36 [2022-07-13 10:10:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79499544] [2022-07-13 10:10:26,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:10:26,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-13 10:10:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:10:26,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-13 10:10:26,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=960, Unknown=27, NotChecked=66, Total=1260 [2022-07-13 10:10:26,697 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:10:28,788 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (.cse2 (* 16 |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= .cse0 4) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (forall ((|v_ULTIMATE.start_main_~j~0#1_21| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_20| Int) (v_ArrVal_64 Int) (v_ArrVal_62 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse1 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_21| (- 4))) v_ArrVal_62) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_20| (- 4))) v_ArrVal_64)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_20| 1) |v_ULTIMATE.start_main_~j~0#1_21|)))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_21| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (<= .cse0 (div (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 4)) (<= .cse0 (select .cse3 (+ .cse2 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 4 (select .cse3 0)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select .cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-13 10:10:30,849 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 16 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (<= 4 (select .cse0 (+ (- 16) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~j~0#1| 2) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (forall ((|v_ULTIMATE.start_main_~j~0#1_21| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_20| Int) (v_ArrVal_64 Int) (v_ArrVal_62 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse2 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_21| (- 4))) v_ArrVal_62) (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_20| (- 4))) v_ArrVal_64)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_20| 1) |v_ULTIMATE.start_main_~j~0#1_21|)))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_21| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 1) (div (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 4)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 4 (select .cse0 0)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-13 10:10:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:10:31,677 INFO L93 Difference]: Finished difference Result 139 states and 165 transitions. [2022-07-13 10:10:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-13 10:10:31,678 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 10:10:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:10:31,679 INFO L225 Difference]: With dead ends: 139 [2022-07-13 10:10:31,679 INFO L226 Difference]: Without dead ends: 113 [2022-07-13 10:10:31,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 61.9s TimeCoverageRelationStatistics Valid=622, Invalid=2783, Unknown=29, NotChecked=348, Total=3782 [2022-07-13 10:10:31,681 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 427 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:10:31,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 150 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 323 Invalid, 0 Unknown, 215 Unchecked, 0.2s Time] [2022-07-13 10:10:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-13 10:10:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 53. [2022-07-13 10:10:31,689 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) [2022-07-13 10:10:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-07-13 10:10:31,690 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 28 [2022-07-13 10:10:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:10:31,690 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-07-13 10:10:31,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:10:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-07-13 10:10:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 10:10:31,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:10:31,691 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:10:31,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 10:10:31,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:10:31,900 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:10:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:10:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1580642084, now seen corresponding path program 1 times [2022-07-13 10:10:31,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:10:31,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035225897] [2022-07-13 10:10:31,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:10:31,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:10:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:10:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:10:32,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:10:32,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035225897] [2022-07-13 10:10:32,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035225897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:10:32,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480099487] [2022-07-13 10:10:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:10:32,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:10:32,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:10:32,290 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:10:32,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 10:10:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:10:32,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 10:10:32,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:10:32,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-13 10:10:32,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:10:32,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-13 10:10:32,532 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-13 10:10:32,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2022-07-13 10:10:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:10:32,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:11:02,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2022-07-13 10:11:02,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 191 [2022-07-13 10:11:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 10:11:05,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480099487] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:11:05,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:11:05,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 39 [2022-07-13 10:11:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258098534] [2022-07-13 10:11:05,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:11:05,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 10:11:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:11:05,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 10:11:05,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1265, Unknown=5, NotChecked=0, Total=1482 [2022-07-13 10:11:05,123 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 39 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 39 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:11:05,455 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-07-13 10:11:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 10:11:05,455 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 39 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 10:11:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:11:05,457 INFO L225 Difference]: With dead ends: 73 [2022-07-13 10:11:05,457 INFO L226 Difference]: Without dead ends: 71 [2022-07-13 10:11:05,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=327, Invalid=1738, Unknown=5, NotChecked=0, Total=2070 [2022-07-13 10:11:05,458 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:11:05,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 197 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 114 Unchecked, 0.1s Time] [2022-07-13 10:11:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-13 10:11:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2022-07-13 10:11:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2022-07-13 10:11:05,477 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 34 [2022-07-13 10:11:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:11:05,478 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2022-07-13 10:11:05,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 39 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-07-13 10:11:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 10:11:05,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:11:05,479 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:11:05,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 10:11:05,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:11:05,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:11:05,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:11:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2045226095, now seen corresponding path program 2 times [2022-07-13 10:11:05,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:11:05,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313856440] [2022-07-13 10:11:05,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:11:05,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:11:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:11:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:11:05,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:11:05,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313856440] [2022-07-13 10:11:05,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313856440] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:11:05,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880325368] [2022-07-13 10:11:05,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:11:05,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:11:05,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:11:05,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:11:05,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 10:11:05,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:11:05,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:11:05,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-13 10:11:05,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:11:06,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 10:11:06,109 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-13 10:11:06,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2022-07-13 10:11:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:11:06,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:11:12,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-07-13 10:11:12,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2022-07-13 10:11:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 10:11:12,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880325368] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:11:12,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:11:12,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 35 [2022-07-13 10:11:12,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438741134] [2022-07-13 10:11:12,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:11:12,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-13 10:11:12,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:11:12,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-13 10:11:12,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 10:11:12,298 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 35 states, 35 states have (on average 3.057142857142857) internal successors, (107), 35 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:11:12,955 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2022-07-13 10:11:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-13 10:11:12,955 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.057142857142857) internal successors, (107), 35 states have internal predecessors, (107), 0 states have call successors, (0), 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 40 [2022-07-13 10:11:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:11:12,956 INFO L225 Difference]: With dead ends: 130 [2022-07-13 10:11:12,956 INFO L226 Difference]: Without dead ends: 86 [2022-07-13 10:11:12,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=408, Invalid=2784, Unknown=0, NotChecked=0, Total=3192 [2022-07-13 10:11:12,958 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 56 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:11:12,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 273 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 306 Invalid, 0 Unknown, 118 Unchecked, 0.2s Time] [2022-07-13 10:11:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-13 10:11:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2022-07-13 10:11:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-07-13 10:11:12,966 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 40 [2022-07-13 10:11:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:11:12,966 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-07-13 10:11:12,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.057142857142857) internal successors, (107), 35 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-07-13 10:11:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 10:11:12,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:11:12,967 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:11:12,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 10:11:13,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:11:13,185 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:11:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:11:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1652199085, now seen corresponding path program 3 times [2022-07-13 10:11:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:11:13,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378008937] [2022-07-13 10:11:13,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:11:13,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:11:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:11:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:11:13,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:11:13,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378008937] [2022-07-13 10:11:13,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378008937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:11:13,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214493305] [2022-07-13 10:11:13,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:11:13,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:11:13,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:11:13,386 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:11:13,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 10:11:13,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 10:11:13,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:11:13,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 10:11:13,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:11:13,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-13 10:11:13,545 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-13 10:11:13,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-13 10:11:13,829 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-07-13 10:11:13,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-13 10:11:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 10:11:13,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:11:14,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-13 10:11:14,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2022-07-13 10:11:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 10:11:14,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214493305] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:11:14,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:11:14,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 35 [2022-07-13 10:11:14,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419792145] [2022-07-13 10:11:14,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:11:14,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-13 10:11:14,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:11:14,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-13 10:11:14,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 10:11:14,116 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:11:15,244 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2022-07-13 10:11:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 10:11:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 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 40 [2022-07-13 10:11:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:11:15,245 INFO L225 Difference]: With dead ends: 121 [2022-07-13 10:11:15,245 INFO L226 Difference]: Without dead ends: 111 [2022-07-13 10:11:15,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=559, Invalid=2092, Unknown=1, NotChecked=0, Total=2652 [2022-07-13 10:11:15,247 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 78 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:11:15,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 247 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 326 Invalid, 0 Unknown, 159 Unchecked, 0.2s Time] [2022-07-13 10:11:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-13 10:11:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2022-07-13 10:11:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-07-13 10:11:15,255 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 40 [2022-07-13 10:11:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:11:15,255 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-07-13 10:11:15,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-07-13 10:11:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 10:11:15,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:11:15,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:11:15,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 10:11:15,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:11:15,473 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:11:15,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:11:15,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2060045762, now seen corresponding path program 4 times [2022-07-13 10:11:15,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:11:15,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981919574] [2022-07-13 10:11:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:11:15,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:11:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:11:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 10:11:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:11:15,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981919574] [2022-07-13 10:11:15,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981919574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:11:15,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173815972] [2022-07-13 10:11:15,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 10:11:15,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:11:15,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:11:15,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:11:15,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 10:11:15,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 10:11:15,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:11:15,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 10:11:15,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:11:15,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 10:11:16,119 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-07-13 10:11:16,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 20 [2022-07-13 10:11:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:11:16,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:11:16,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-07-13 10:11:16,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-13 10:11:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:11:16,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173815972] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:11:16,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:11:16,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 36 [2022-07-13 10:11:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008258065] [2022-07-13 10:11:16,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:11:16,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-13 10:11:16,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:11:16,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-13 10:11:16,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 10:11:16,425 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 36 states, 36 states have (on average 3.361111111111111) internal successors, (121), 36 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:11:18,573 INFO L93 Difference]: Finished difference Result 306 states and 357 transitions. [2022-07-13 10:11:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-13 10:11:18,573 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.361111111111111) internal successors, (121), 36 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-13 10:11:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:11:18,574 INFO L225 Difference]: With dead ends: 306 [2022-07-13 10:11:18,575 INFO L226 Difference]: Without dead ends: 266 [2022-07-13 10:11:18,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3549 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1625, Invalid=9087, Unknown=0, NotChecked=0, Total=10712 [2022-07-13 10:11:18,577 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 367 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 10:11:18,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 349 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 968 Invalid, 0 Unknown, 97 Unchecked, 0.5s Time] [2022-07-13 10:11:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-13 10:11:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 121. [2022-07-13 10:11:18,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 120 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-07-13 10:11:18,589 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 46 [2022-07-13 10:11:18,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:11:18,589 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-07-13 10:11:18,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.361111111111111) internal successors, (121), 36 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 10:11:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-07-13 10:11:18,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 10:11:18,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:11:18,591 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:11:18,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 10:11:18,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:11:18,808 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:11:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:11:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 502824842, now seen corresponding path program 1 times [2022-07-13 10:11:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:11:18,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879136077] [2022-07-13 10:11:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:11:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:11:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:11:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 13 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:11:19,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:11:19,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879136077] [2022-07-13 10:11:19,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879136077] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:11:19,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700819904] [2022-07-13 10:11:19,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:11:19,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:11:19,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:11:19,407 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 10:11:19,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 10:11:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:11:19,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-13 10:11:19,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:11:19,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-13 10:11:19,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:11:19,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-13 10:11:19,679 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-13 10:11:19,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-07-13 10:11:19,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:11:19,878 INFO L356 Elim1Store]: treesize reduction 47, result has 35.6 percent of original size [2022-07-13 10:11:19,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 62 [2022-07-13 10:11:19,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:11:19,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2022-07-13 10:11:20,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:11:20,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2022-07-13 10:11:20,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:11:20,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2022-07-13 10:11:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 9 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:11:20,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:11:43,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_64| Int) (v_ArrVal_209 Int) (v_ArrVal_208 Int)) (let ((.cse0 (select (let ((.cse1 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_64| 1) |c_ULTIMATE.start_main_~j~0#1|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))) is different from false [2022-07-13 10:11:45,215 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_65| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_64| Int) (v_ArrVal_209 Int) (v_ArrVal_208 Int)) (let ((.cse0 (select (let ((.cse1 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_65| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_64| 1) |v_ULTIMATE.start_main_~j~0#1_65|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_65| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-13 10:11:47,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~j~0#1_65| Int) (v_ArrVal_209 Int) (v_ArrVal_208 Int) (v_ArrVal_206 Int)) (let ((.cse0 (select (let ((.cse1 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_206) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_65| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_65| 1) |c_ULTIMATE.start_main_~j~0#1|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_64| 1) |v_ULTIMATE.start_main_~j~0#1_65|))))) is different from false [2022-07-13 10:11:49,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~j~0#1_65| Int) (v_ArrVal_209 Int) (v_ArrVal_208 Int) (v_ArrVal_206 Int)) (let ((.cse0 (select (let ((.cse1 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_206) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_65| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_65| 1) |v_ULTIMATE.start_main_~j~0#1_66|)) (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_64| 1) |v_ULTIMATE.start_main_~j~0#1_65|))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_66| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-13 10:12:59,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_67| Int)) (or (forall ((v_ArrVal_203 Int) (|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~j~0#1_65| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_209 Int) (v_ArrVal_208 Int) (v_ArrVal_206 Int)) (let ((.cse0 (select (let ((.cse1 (* 16 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_67| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_203) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_206) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_65| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_66| 1) |v_ULTIMATE.start_main_~j~0#1_67|)) (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_65| 1) |v_ULTIMATE.start_main_~j~0#1_66|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_64| 1) |v_ULTIMATE.start_main_~j~0#1_65|))))) (not (<= |v_ULTIMATE.start_main_~j~0#1_67| 4)))) is different from false [2022-07-13 10:13:01,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_58| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_67| Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_67| 4)) (forall ((v_ArrVal_203 Int) (|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~j~0#1_65| Int) (|v_ULTIMATE.start_main_~j~0#1_66| Int) (v_ArrVal_209 Int) (v_ArrVal_208 Int) (v_ArrVal_206 Int)) (let ((.cse0 (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_58| 16))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_67| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_203) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_66| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_206) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_65| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_208) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_66| 1) |v_ULTIMATE.start_main_~j~0#1_67|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_65| 1) |v_ULTIMATE.start_main_~j~0#1_66|)) (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_64| 1) |v_ULTIMATE.start_main_~j~0#1_65|))))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_58|)))) is different from false