./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/nr5.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 7a05e17fa6f76d5004d5085f0b83441da7dbecb194f05c3b661e69c00b5f4df0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 09:47:02,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 09:47:02,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 09:47:03,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 09:47:03,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 09:47:03,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 09:47:03,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 09:47:03,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 09:47:03,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 09:47:03,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 09:47:03,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 09:47:03,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 09:47:03,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 09:47:03,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 09:47:03,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 09:47:03,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 09:47:03,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 09:47:03,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 09:47:03,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 09:47:03,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 09:47:03,060 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 09:47:03,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 09:47:03,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 09:47:03,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 09:47:03,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 09:47:03,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 09:47:03,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 09:47:03,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 09:47:03,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 09:47:03,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 09:47:03,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 09:47:03,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 09:47:03,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 09:47:03,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 09:47:03,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 09:47:03,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 09:47:03,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 09:47:03,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 09:47:03,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 09:47:03,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 09:47:03,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 09:47:03,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 09:47:03,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 09:47:03,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 09:47:03,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 09:47:03,091 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 09:47:03,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 09:47:03,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 09:47:03,092 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 09:47:03,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 09:47:03,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 09:47:03,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 09:47:03,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 09:47:03,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 09:47:03,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 09:47:03,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 09:47:03,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 09:47:03,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 09:47:03,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 09:47:03,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 09:47:03,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 09:47:03,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 09:47:03,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 09:47:03,094 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 09:47:03,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 09:47:03,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 09:47:03,095 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 -> 7a05e17fa6f76d5004d5085f0b83441da7dbecb194f05c3b661e69c00b5f4df0 [2022-07-22 09:47:03,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 09:47:03,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 09:47:03,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 09:47:03,303 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 09:47:03,303 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 09:47:03,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr5.c [2022-07-22 09:47:03,372 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e125ea4c/917c53f1c6a74afd823f7ee8a1bf2ef0/FLAGa80550993 [2022-07-22 09:47:03,719 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 09:47:03,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr5.c [2022-07-22 09:47:03,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e125ea4c/917c53f1c6a74afd823f7ee8a1bf2ef0/FLAGa80550993 [2022-07-22 09:47:03,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e125ea4c/917c53f1c6a74afd823f7ee8a1bf2ef0 [2022-07-22 09:47:03,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 09:47:03,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 09:47:03,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 09:47:03,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 09:47:03,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 09:47:03,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416be275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03, skipping insertion in model container [2022-07-22 09:47:03,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 09:47:03,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 09:47:03,840 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/nr5.c[394,407] [2022-07-22 09:47:03,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 09:47:03,895 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 09:47:03,912 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/nr5.c[394,407] [2022-07-22 09:47:03,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 09:47:03,926 INFO L208 MainTranslator]: Completed translation [2022-07-22 09:47:03,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03 WrapperNode [2022-07-22 09:47:03,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 09:47:03,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 09:47:03,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 09:47:03,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 09:47:03,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,949 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2022-07-22 09:47:03,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 09:47:03,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 09:47:03,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 09:47:03,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 09:47:03,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 09:47:03,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 09:47:03,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 09:47:03,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 09:47:03,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (1/1) ... [2022-07-22 09:47:03,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 09:47:03,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:03,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 09:47:04,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 09:47:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 09:47:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 09:47:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 09:47:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 09:47:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 09:47:04,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 09:47:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 09:47:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 09:47:04,069 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 09:47:04,071 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 09:47:04,194 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 09:47:04,199 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 09:47:04,199 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 09:47:04,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:47:04 BoogieIcfgContainer [2022-07-22 09:47:04,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 09:47:04,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 09:47:04,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 09:47:04,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 09:47:04,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:47:03" (1/3) ... [2022-07-22 09:47:04,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e05c9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:47:04, skipping insertion in model container [2022-07-22 09:47:04,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:03" (2/3) ... [2022-07-22 09:47:04,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e05c9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:47:04, skipping insertion in model container [2022-07-22 09:47:04,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:47:04" (3/3) ... [2022-07-22 09:47:04,207 INFO L111 eAbstractionObserver]: Analyzing ICFG nr5.c [2022-07-22 09:47:04,216 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 09:47:04,217 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 09:47:04,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 09:47:04,265 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@1c22a0ef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2bf04f61 [2022-07-22 09:47:04,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 09:47:04,268 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-22 09:47:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 09:47:04,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:04,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:04,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:04,278 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-22 09:47:04,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:04,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080631735] [2022-07-22 09:47:04,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:04,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:04,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:04,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080631735] [2022-07-22 09:47:04,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080631735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:47:04,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:47:04,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 09:47:04,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635716027] [2022-07-22 09:47:04,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:47:04,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 09:47:04,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 09:47:04,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 09:47:04,424 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-22 09:47:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:04,438 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-22 09:47:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 09:47:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 09:47:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:04,445 INFO L225 Difference]: With dead ends: 45 [2022-07-22 09:47:04,445 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 09:47:04,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 09:47:04,454 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-22 09:47:04,455 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-22 09:47:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 09:47:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 09:47:04,475 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-22 09:47:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-22 09:47:04,477 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-22 09:47:04,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:04,477 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-22 09:47:04,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-22 09:47:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 09:47:04,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:04,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:04,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 09:47:04,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:04,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:04,481 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-22 09:47:04,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:04,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060687462] [2022-07-22 09:47:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:04,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:04,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:04,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060687462] [2022-07-22 09:47:04,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060687462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:47:04,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:47:04,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 09:47:04,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291303765] [2022-07-22 09:47:04,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:47:04,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 09:47:04,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:04,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 09:47:04,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 09:47:04,578 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-22 09:47:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:04,619 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-07-22 09:47:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 09:47:04,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 09:47:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:04,620 INFO L225 Difference]: With dead ends: 29 [2022-07-22 09:47:04,621 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 09:47:04,621 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-22 09:47:04,622 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-22 09:47:04,624 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-22 09:47:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 09:47:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-22 09:47:04,629 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-22 09:47:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-22 09:47:04,630 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-22 09:47:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:04,630 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-22 09:47:04,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-22 09:47:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 09:47:04,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:04,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:04,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 09:47:04,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:04,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash 274152825, now seen corresponding path program 1 times [2022-07-22 09:47:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:04,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633244642] [2022-07-22 09:47:04,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:04,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:04,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:04,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633244642] [2022-07-22 09:47:04,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633244642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:47:04,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:47:04,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 09:47:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951861358] [2022-07-22 09:47:04,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:47:04,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 09:47:04,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 09:47:04,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 09:47:04,793 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-22 09:47:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:04,837 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-22 09:47:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 09:47:04,838 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-22 09:47:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:04,839 INFO L225 Difference]: With dead ends: 38 [2022-07-22 09:47:04,839 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 09:47:04,840 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-22 09:47:04,841 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-22 09:47:04,842 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-22 09:47:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 09:47:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-22 09:47:04,847 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-22 09:47:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-22 09:47:04,847 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-22 09:47:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:04,847 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-22 09:47:04,848 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-22 09:47:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-22 09:47:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 09:47:04,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:04,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:04,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 09:47:04,849 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:04,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash -715167033, now seen corresponding path program 1 times [2022-07-22 09:47:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:04,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014879856] [2022-07-22 09:47:04,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:04,905 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-22 09:47:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:04,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014879856] [2022-07-22 09:47:04,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014879856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:47:04,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:47:04,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 09:47:04,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189220690] [2022-07-22 09:47:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:47:04,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 09:47:04,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:04,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 09:47:04,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 09:47:04,909 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-22 09:47:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:04,924 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-22 09:47:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 09:47:04,925 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-22 09:47:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:04,926 INFO L225 Difference]: With dead ends: 42 [2022-07-22 09:47:04,926 INFO L226 Difference]: Without dead ends: 26 [2022-07-22 09:47:04,927 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-22 09:47:04,927 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-22 09:47:04,930 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-22 09:47:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-22 09:47:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-07-22 09:47:04,935 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-22 09:47:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-22 09:47:04,936 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-22 09:47:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:04,937 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-22 09:47:04,937 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-22 09:47:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-22 09:47:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 09:47:04,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:04,938 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-22 09:47:04,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 09:47:04,939 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:04,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1618667584, now seen corresponding path program 1 times [2022-07-22 09:47:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:04,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784099078] [2022-07-22 09:47:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:04,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:04,975 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-22 09:47:04,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:04,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784099078] [2022-07-22 09:47:04,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784099078] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:04,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474869447] [2022-07-22 09:47:04,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:04,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:04,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:04,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:04,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 09:47:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:05,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 09:47:05,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:05,087 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-22 09:47:05,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:05,102 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-22 09:47:05,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474869447] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:47:05,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:47:05,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-22 09:47:05,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5987618] [2022-07-22 09:47:05,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:47:05,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 09:47:05,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:05,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 09:47:05,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 09:47:05,104 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-22 09:47:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:05,128 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-07-22 09:47:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 09:47:05,128 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-22 09:47:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:05,129 INFO L225 Difference]: With dead ends: 50 [2022-07-22 09:47:05,129 INFO L226 Difference]: Without dead ends: 33 [2022-07-22 09:47:05,129 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-22 09:47:05,130 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-22 09:47:05,130 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-22 09:47:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-22 09:47:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-22 09:47:05,133 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-22 09:47:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-22 09:47:05,134 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 19 [2022-07-22 09:47:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:05,134 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-22 09:47:05,134 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-22 09:47:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-07-22 09:47:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 09:47:05,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:05,135 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-22 09:47:05,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 09:47:05,355 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-22 09:47:05,356 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2124634745, now seen corresponding path program 2 times [2022-07-22 09:47:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:05,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898753399] [2022-07-22 09:47:05,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:05,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:05,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898753399] [2022-07-22 09:47:05,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898753399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:05,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209998482] [2022-07-22 09:47:05,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 09:47:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:05,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:05,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:05,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 09:47:05,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 09:47:05,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:47:05,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 09:47:05,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:05,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:05,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209998482] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:47:05,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:47:05,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-22 09:47:05,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624259372] [2022-07-22 09:47:05,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:47:05,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 09:47:05,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:05,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 09:47:05,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-22 09:47:05,515 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:05,546 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-07-22 09:47:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 09:47:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-22 09:47:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:05,547 INFO L225 Difference]: With dead ends: 62 [2022-07-22 09:47:05,547 INFO L226 Difference]: Without dead ends: 36 [2022-07-22 09:47:05,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-22 09:47:05,548 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 09:47:05,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 52 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 09:47:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-22 09:47:05,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-22 09:47:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-22 09:47:05,552 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2022-07-22 09:47:05,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:05,552 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-22 09:47:05,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-22 09:47:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 09:47:05,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:05,553 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:05,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 09:47:05,771 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-22 09:47:05,771 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:05,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash -233654912, now seen corresponding path program 3 times [2022-07-22 09:47:05,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:05,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389907315] [2022-07-22 09:47:05,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:05,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:05,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:05,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389907315] [2022-07-22 09:47:05,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389907315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:05,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719137118] [2022-07-22 09:47:05,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 09:47:05,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:05,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:05,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:05,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 09:47:05,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 09:47:05,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:47:05,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 09:47:05,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 09:47:05,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 09:47:05,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719137118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:47:05,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:47:05,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2022-07-22 09:47:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465653903] [2022-07-22 09:47:05,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:47:05,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 09:47:05,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:05,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 09:47:05,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-22 09:47:05,971 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:06,045 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-07-22 09:47:06,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 09:47:06,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-22 09:47:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:06,047 INFO L225 Difference]: With dead ends: 70 [2022-07-22 09:47:06,047 INFO L226 Difference]: Without dead ends: 41 [2022-07-22 09:47:06,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-07-22 09:47:06,048 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 09:47:06,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 59 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 09:47:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-22 09:47:06,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-07-22 09:47:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-07-22 09:47:06,052 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 31 [2022-07-22 09:47:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:06,052 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-07-22 09:47:06,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:47:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-07-22 09:47:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 09:47:06,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:06,053 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:47:06,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 09:47:06,274 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-22 09:47:06,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:06,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash 467409666, now seen corresponding path program 1 times [2022-07-22 09:47:06,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:06,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009023005] [2022-07-22 09:47:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:06,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:06,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009023005] [2022-07-22 09:47:06,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009023005] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:06,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647108451] [2022-07-22 09:47:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:06,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:06,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:06,652 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:06,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 09:47:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:06,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 09:47:06,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:06,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 09:47:06,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:47:06,838 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-22 09:47:06,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:47:06,880 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-22 09:47:06,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:47:06,927 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-22 09:47:06,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:47:06,972 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-22 09:47:07,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 09:47:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:07,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:24,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))))) is different from false [2022-07-22 09:47:36,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse0) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) is different from false [2022-07-22 09:47:56,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_38| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_38| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (|v_ULTIMATE.start_main_~j~0#1_37| Int) (v_ArrVal_88 Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |v_ULTIMATE.start_main_~j~0#1_38|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_38| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_88) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse0) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) is different from false [2022-07-22 09:47:56,937 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 57 treesize of output 55 [2022-07-22 09:47:56,953 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 3440 treesize of output 3432 [2022-07-22 09:48:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 21 refuted. 4 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-22 09:48:01,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647108451] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:48:01,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:48:01,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 16] total 40 [2022-07-22 09:48:01,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87835579] [2022-07-22 09:48:01,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:48:01,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-22 09:48:01,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:48:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-22 09:48:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1078, Unknown=27, NotChecked=216, Total=1560 [2022-07-22 09:48:01,560 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:48:03,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 20 |c_ULTIMATE.start_main_~i~0#1|)))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) .cse2))) (and (<= |c_ULTIMATE.start_main_~j~0#1| .cse0) (= |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|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (forall ((|v_ULTIMATE.start_main_~j~0#1_38| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_38| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (|v_ULTIMATE.start_main_~j~0#1_37| Int) (v_ArrVal_88 Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |v_ULTIMATE.start_main_~j~0#1_38|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_38| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_88) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse1) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (= .cse2 0) (= .cse0 5) (= |c_ULTIMATE.start_main_~j~0#1| 5) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-07-22 09:48:05,653 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse2 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (= 5 (select .cse0 0)) (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse1) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (<= |c_ULTIMATE.start_main_~j~0#1| 4) (<= 5 (select .cse0 (+ (- 20) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 1) (div (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) 4)) (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_94)) |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-22 09:48:07,707 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (= 5 (select .cse0 0)) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2) (div (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) 4)) (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse2 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse2) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (<= 5 (select .cse0 (+ (- 20) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1))) (= |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| 3) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_94)) |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-22 09:48:09,794 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (= 5 (select .cse0 0)) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2) (div (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) 4)) (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse2 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse2) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (<= 5 (select .cse0 (+ (- 20) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1))) (= |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) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_94)) |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-22 09:48:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:48:10,249 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-07-22 09:48:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 09:48:10,250 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-22 09:48:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:48:10,252 INFO L225 Difference]: With dead ends: 119 [2022-07-22 09:48:10,252 INFO L226 Difference]: Without dead ends: 109 [2022-07-22 09:48:10,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 62.4s TimeCoverageRelationStatistics Valid=587, Invalid=2380, Unknown=31, NotChecked=784, Total=3782 [2022-07-22 09:48:10,253 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 145 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 09:48:10,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 183 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 417 Invalid, 0 Unknown, 328 Unchecked, 0.2s Time] [2022-07-22 09:48:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-22 09:48:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2022-07-22 09:48:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:48:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-07-22 09:48:10,260 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 31 [2022-07-22 09:48:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:48:10,260 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-07-22 09:48:10,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:48:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-07-22 09:48:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 09:48:10,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:48:10,261 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:48:10,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-22 09:48:10,488 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-22 09:48:10,489 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:48:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:48:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash 594002453, now seen corresponding path program 1 times [2022-07-22 09:48:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:48:10,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342774228] [2022-07-22 09:48:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:48:10,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:48:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:48:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:48:10,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:48:10,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342774228] [2022-07-22 09:48:10,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342774228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:48:10,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527572767] [2022-07-22 09:48:10,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:48:10,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:48:10,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:48:11,003 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:48:11,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 09:48:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:48:11,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 09:48:11,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:48:11,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 09:48:11,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:48:11,214 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-22 09:48:11,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:48:11,267 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-22 09:48:11,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:48:11,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-22 09:48:11,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 09:48:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:48:11,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:48:50,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-22 09:49:05,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int) (v_ArrVal_121 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4)) .cse0) v_ArrVal_121) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-22 09:49:05,776 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 49 treesize of output 47 [2022-07-22 09:49:05,780 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 1972 treesize of output 1956 [2022-07-22 09:49:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 29 refuted. 2 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-22 09:49:09,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527572767] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:49:09,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:49:09,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 41 [2022-07-22 09:49:09,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138530859] [2022-07-22 09:49:09,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:49:09,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-22 09:49:09,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:49:09,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-22 09:49:09,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1212, Unknown=30, NotChecked=150, Total=1640 [2022-07-22 09:49:09,377 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:49:11,434 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int) (v_ArrVal_121 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4)) .cse0) v_ArrVal_121) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~j~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) .cse1)) |c_ULTIMATE.start_main_~j~0#1|) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (< (+ 3 (* |c_ULTIMATE.start_main_~j~0#1| 4)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0))) is different from false [2022-07-22 09:49:13,457 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (= |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| 3) (<= 4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)) is different from false [2022-07-22 09:49:15,556 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (<= 4 (select .cse0 (+ (- 16) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 20 |c_ULTIMATE.start_main_~i~0#1|)))) (forall ((|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse1) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse1) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (= |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) (<= |c_ULTIMATE.start_main_~j~0#1| 3) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 4 (select .cse0 4)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-22 09:49:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:49:20,262 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2022-07-22 09:49:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 09:49:20,262 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 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 37 [2022-07-22 09:49:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:49:20,263 INFO L225 Difference]: With dead ends: 129 [2022-07-22 09:49:20,263 INFO L226 Difference]: Without dead ends: 119 [2022-07-22 09:49:20,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 67.3s TimeCoverageRelationStatistics Valid=591, Invalid=2934, Unknown=35, NotChecked=600, Total=4160 [2022-07-22 09:49:20,264 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 333 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 09:49:20,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 205 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 468 Invalid, 0 Unknown, 218 Unchecked, 0.2s Time] [2022-07-22 09:49:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-22 09:49:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 79. [2022-07-22 09:49:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:49:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2022-07-22 09:49:20,277 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 37 [2022-07-22 09:49:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:49:20,278 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2022-07-22 09:49:20,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:49:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-07-22 09:49:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 09:49:20,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:49:20,281 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:49:20,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 09:49:20,497 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-22 09:49:20,498 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:49:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:49:20,499 INFO L85 PathProgramCache]: Analyzing trace with hash 879791848, now seen corresponding path program 2 times [2022-07-22 09:49:20,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:49:20,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865717651] [2022-07-22 09:49:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:49:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:49:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:49:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:49:20,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:49:20,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865717651] [2022-07-22 09:49:20,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865717651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:49:20,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690913486] [2022-07-22 09:49:20,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 09:49:20,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:49:20,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:49:20,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:49:20,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 09:49:20,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 09:49:20,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:49:20,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 09:49:20,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:49:21,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 09:49:21,084 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-22 09:49:21,084 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-22 09:49:21,131 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:49:21,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-07-22 09:49:21,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 09:49:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:49:21,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:49:59,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_58| Int)) (or (forall ((v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~j~0#1_57| Int) (v_ArrVal_153 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_57| 1) |v_ULTIMATE.start_main_~j~0#1_58|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_58| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_153) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_156)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_58| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-22 09:49:59,149 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 37 [2022-07-22 09:49:59,152 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 224 treesize of output 220 [2022-07-22 09:50:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-22 09:50:01,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690913486] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:50:01,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:50:01,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 16] total 45 [2022-07-22 09:50:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934213148] [2022-07-22 09:50:01,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:50:01,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-22 09:50:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:50:01,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-22 09:50:01,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1615, Unknown=21, NotChecked=84, Total=1980 [2022-07-22 09:50:01,360 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:03,528 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse2 (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0)) (.cse1 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))) (and (<= 3 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 20 |c_ULTIMATE.start_main_~i~0#1|)))) (<= 3 |c_ULTIMATE.start_main_~j~0#1|) (or (and (<= 3 .cse1) .cse2) (= .cse1 0)) .cse2 (<= |c_ULTIMATE.start_main_~j~0#1| 3) (forall ((|v_ULTIMATE.start_main_~j~0#1_58| Int)) (or (forall ((v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~j~0#1_57| Int) (v_ArrVal_153 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_57| 1) |v_ULTIMATE.start_main_~j~0#1_58|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_58| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_153) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_156)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_58| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)))) is different from false [2022-07-22 09:50:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:50:04,663 INFO L93 Difference]: Finished difference Result 273 states and 314 transitions. [2022-07-22 09:50:04,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-22 09:50:04,664 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-22 09:50:04,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:50:04,665 INFO L225 Difference]: With dead ends: 273 [2022-07-22 09:50:04,665 INFO L226 Difference]: Without dead ends: 212 [2022-07-22 09:50:04,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=822, Invalid=5016, Unknown=22, NotChecked=302, Total=6162 [2022-07-22 09:50:04,666 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 526 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 09:50:04,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 300 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 795 Invalid, 0 Unknown, 221 Unchecked, 0.4s Time] [2022-07-22 09:50:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-22 09:50:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 120. [2022-07-22 09:50:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 119 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2022-07-22 09:50:04,677 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 43 [2022-07-22 09:50:04,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:50:04,679 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2022-07-22 09:50:04,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-07-22 09:50:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 09:50:04,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:50:04,680 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:50:04,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-22 09:50:04,895 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-22 09:50:04,896 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:50:04,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:50:04,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1886597499, now seen corresponding path program 3 times [2022-07-22 09:50:04,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:50:04,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522181350] [2022-07-22 09:50:04,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:50:04,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:50:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:50:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:50:05,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:50:05,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522181350] [2022-07-22 09:50:05,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522181350] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:50:05,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648556086] [2022-07-22 09:50:05,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 09:50:05,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:50:05,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:50:05,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:50:05,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 09:50:05,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 09:50:05,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:50:05,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 09:50:05,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:50:05,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 09:50:05,403 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-22 09:50:05,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, 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-22 09:50:05,723 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-07-22 09:50:05,724 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-22 09:50:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 17 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 09:50:05,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:50:05,975 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-22 09:50:05,978 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 234 treesize of output 226 [2022-07-22 09:50:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 09:50:06,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648556086] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:50:06,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:50:06,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 39 [2022-07-22 09:50:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056448303] [2022-07-22 09:50:06,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:50:06,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 09:50:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:50:06,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 09:50:06,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1220, Unknown=0, NotChecked=0, Total=1482 [2022-07-22 09:50:06,049 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:50:06,954 INFO L93 Difference]: Finished difference Result 178 states and 202 transitions. [2022-07-22 09:50:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-22 09:50:06,955 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 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 49 [2022-07-22 09:50:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:50:06,956 INFO L225 Difference]: With dead ends: 178 [2022-07-22 09:50:06,956 INFO L226 Difference]: Without dead ends: 168 [2022-07-22 09:50:06,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=704, Invalid=2956, Unknown=0, NotChecked=0, Total=3660 [2022-07-22 09:50:06,957 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 252 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 09:50:06,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 312 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 569 Invalid, 0 Unknown, 217 Unchecked, 0.3s Time] [2022-07-22 09:50:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-22 09:50:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2022-07-22 09:50:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.16) internal successors, (145), 125 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2022-07-22 09:50:06,974 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 49 [2022-07-22 09:50:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:50:06,974 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2022-07-22 09:50:06,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2022-07-22 09:50:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 09:50:06,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:50:06,975 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:50:06,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-22 09:50:07,195 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-22 09:50:07,196 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:50:07,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:50:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash -185464757, now seen corresponding path program 2 times [2022-07-22 09:50:07,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:50:07,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853305463] [2022-07-22 09:50:07,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:50:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:50:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:50:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 7 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:50:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:50:07,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853305463] [2022-07-22 09:50:07,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853305463] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:50:07,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292425499] [2022-07-22 09:50:07,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 09:50:07,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:50:07,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:50:07,862 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:50:07,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 09:50:07,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 09:50:07,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:50:07,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-22 09:50:07,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:50:07,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 09:50:08,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:50:08,036 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-22 09:50:08,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:50:08,079 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-22 09:50:08,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:50:08,121 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-22 09:50:08,170 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-22 09:50:08,170 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-22 09:50:08,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:50:08,326 INFO L356 Elim1Store]: treesize reduction 45, result has 36.6 percent of original size [2022-07-22 09:50:08,326 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 47 treesize of output 59 [2022-07-22 09:50:08,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:50:08,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2022-07-22 09:50:08,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:50:08,471 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 34 treesize of output 29 [2022-07-22 09:50:08,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:50:08,526 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 34 treesize of output 29 [2022-07-22 09:50:08,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:50:08,579 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 34 treesize of output 29 [2022-07-22 09:50:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 25 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:50:08,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:51:29,904 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_81| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_81| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_245 Int) (|v_ULTIMATE.start_main_~j~0#1_80| Int) (v_ArrVal_248 Int)) (let ((.cse0 (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_81| (- 4))) v_ArrVal_245) (+ (* |v_ULTIMATE.start_main_~j~0#1_80| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_248)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_80| 1) |v_ULTIMATE.start_main_~j~0#1_81|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))))) is different from false