./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ms2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ms2.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 125fe310e2ae1e5a109eb21d52d95bf156448ac6c5b2e6793bd0b6f80e48ce1d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 01:48:44,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 01:48:44,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 01:48:44,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 01:48:44,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 01:48:44,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 01:48:44,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 01:48:44,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 01:48:44,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 01:48:44,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 01:48:44,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 01:48:44,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 01:48:44,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 01:48:44,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 01:48:44,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 01:48:44,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 01:48:44,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 01:48:44,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 01:48:44,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 01:48:44,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 01:48:44,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 01:48:44,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 01:48:44,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 01:48:44,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 01:48:44,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 01:48:44,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 01:48:44,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 01:48:44,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 01:48:44,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 01:48:44,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 01:48:44,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 01:48:44,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 01:48:44,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 01:48:44,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 01:48:44,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 01:48:44,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 01:48:44,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 01:48:44,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 01:48:44,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 01:48:44,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 01:48:44,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 01:48:44,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 01:48:44,288 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 01:48:44,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 01:48:44,289 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 01:48:44,289 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 01:48:44,290 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 01:48:44,290 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 01:48:44,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 01:48:44,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 01:48:44,291 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 01:48:44,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 01:48:44,292 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 01:48:44,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 01:48:44,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 01:48:44,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 01:48:44,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 01:48:44,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 01:48:44,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 01:48:44,293 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 01:48:44,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 01:48:44,293 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 01:48:44,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 01:48:44,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 01:48:44,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 01:48:44,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 01:48:44,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 01:48:44,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 01:48:44,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 01:48:44,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 01:48:44,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 01:48:44,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 01:48:44,296 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 01:48:44,296 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 01:48:44,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 01:48:44,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 01:48:44,297 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 -> 125fe310e2ae1e5a109eb21d52d95bf156448ac6c5b2e6793bd0b6f80e48ce1d [2021-12-17 01:48:44,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 01:48:44,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 01:48:44,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 01:48:44,496 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 01:48:44,496 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 01:48:44,497 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ms2.c [2021-12-17 01:48:44,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf186bbe0/41fdc02bb8d94128982f0a336515fca9/FLAGa7cc466a3 [2021-12-17 01:48:44,839 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 01:48:44,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms2.c [2021-12-17 01:48:44,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf186bbe0/41fdc02bb8d94128982f0a336515fca9/FLAGa7cc466a3 [2021-12-17 01:48:45,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf186bbe0/41fdc02bb8d94128982f0a336515fca9 [2021-12-17 01:48:45,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 01:48:45,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 01:48:45,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 01:48:45,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 01:48:45,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 01:48:45,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5652c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45, skipping insertion in model container [2021-12-17 01:48:45,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 01:48:45,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 01:48:45,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms2.c[586,599] [2021-12-17 01:48:45,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 01:48:45,435 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 01:48:45,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms2.c[586,599] [2021-12-17 01:48:45,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 01:48:45,468 INFO L208 MainTranslator]: Completed translation [2021-12-17 01:48:45,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45 WrapperNode [2021-12-17 01:48:45,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 01:48:45,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 01:48:45,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 01:48:45,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 01:48:45,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,500 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2021-12-17 01:48:45,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 01:48:45,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 01:48:45,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 01:48:45,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 01:48:45,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 01:48:45,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 01:48:45,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 01:48:45,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 01:48:45,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (1/1) ... [2021-12-17 01:48:45,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 01:48:45,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:48:45,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 01:48:45,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 01:48:45,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 01:48:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 01:48:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 01:48:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 01:48:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 01:48:45,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 01:48:45,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 01:48:45,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 01:48:45,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 01:48:45,651 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 01:48:45,652 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 01:48:45,779 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 01:48:45,783 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 01:48:45,784 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 01:48:45,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 01:48:45 BoogieIcfgContainer [2021-12-17 01:48:45,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 01:48:45,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 01:48:45,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 01:48:45,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 01:48:45,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 01:48:45" (1/3) ... [2021-12-17 01:48:45,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3e74c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 01:48:45, skipping insertion in model container [2021-12-17 01:48:45,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:48:45" (2/3) ... [2021-12-17 01:48:45,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3e74c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 01:48:45, skipping insertion in model container [2021-12-17 01:48:45,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 01:48:45" (3/3) ... [2021-12-17 01:48:45,808 INFO L111 eAbstractionObserver]: Analyzing ICFG ms2.c [2021-12-17 01:48:45,812 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 01:48:45,812 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 01:48:45,856 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 01:48:45,861 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 01:48:45,861 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 01:48:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) [2021-12-17 01:48:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 01:48:45,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:48:45,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:48:45,874 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:48:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:48:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-12-17 01:48:45,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:48:45,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255625727] [2021-12-17 01:48:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:48:45,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:48:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:48:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:45,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:48:45,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255625727] [2021-12-17 01:48:45,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255625727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 01:48:45,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 01:48:45,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 01:48:45,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589788177] [2021-12-17 01:48:45,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 01:48:45,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 01:48:45,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:48:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 01:48:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 01:48:46,003 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:46,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:48:46,012 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-12-17 01:48:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 01:48:46,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-12-17 01:48:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:48:46,018 INFO L225 Difference]: With dead ends: 34 [2021-12-17 01:48:46,019 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 01:48:46,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 01:48:46,023 INFO L933 BasicCegarLoop]: 22 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, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 01:48:46,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 01:48:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 01:48:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-17 01:48:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-17 01:48:46,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-12-17 01:48:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:48:46,044 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-17 01:48:46,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-17 01:48:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 01:48:46,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:48:46,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:48:46,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 01:48:46,046 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:48:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:48:46,046 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-12-17 01:48:46,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:48:46,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218611869] [2021-12-17 01:48:46,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:48:46,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:48:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:48:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:46,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:48:46,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218611869] [2021-12-17 01:48:46,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218611869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 01:48:46,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 01:48:46,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 01:48:46,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128279482] [2021-12-17 01:48:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 01:48:46,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 01:48:46,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:48:46,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 01:48:46,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 01:48:46,108 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:48:46,160 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-17 01:48:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 01:48:46,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2021-12-17 01:48:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:48:46,161 INFO L225 Difference]: With dead ends: 28 [2021-12-17 01:48:46,162 INFO L226 Difference]: Without dead ends: 20 [2021-12-17 01:48:46,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 01:48:46,163 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 01:48:46,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 01:48:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-17 01:48:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-17 01:48:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-12-17 01:48:46,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2021-12-17 01:48:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:48:46,168 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-12-17 01:48:46,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-12-17 01:48:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 01:48:46,169 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:48:46,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:48:46,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 01:48:46,169 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:48:46,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:48:46,170 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-12-17 01:48:46,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:48:46,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826028956] [2021-12-17 01:48:46,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:48:46,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:48:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:48:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 01:48:46,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:48:46,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826028956] [2021-12-17 01:48:46,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826028956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 01:48:46,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 01:48:46,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 01:48:46,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501027632] [2021-12-17 01:48:46,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 01:48:46,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 01:48:46,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:48:46,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 01:48:46,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 01:48:46,259 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) [2021-12-17 01:48:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:48:46,330 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-12-17 01:48:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 01:48:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 [2021-12-17 01:48:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:48:46,330 INFO L225 Difference]: With dead ends: 25 [2021-12-17 01:48:46,331 INFO L226 Difference]: Without dead ends: 21 [2021-12-17 01:48:46,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 01:48:46,332 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 01:48:46,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 01:48:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-17 01:48:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-17 01:48:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-17 01:48:46,335 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2021-12-17 01:48:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:48:46,336 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-17 01:48:46,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) [2021-12-17 01:48:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-17 01:48:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 01:48:46,337 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:48:46,337 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:48:46,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 01:48:46,337 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:48:46,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:48:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash -422196611, now seen corresponding path program 1 times [2021-12-17 01:48:46,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:48:46,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084563594] [2021-12-17 01:48:46,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:48:46,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:48:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:48:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:46,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:48:46,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084563594] [2021-12-17 01:48:46,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084563594] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:48:46,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417040178] [2021-12-17 01:48:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:48:46,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:48:46,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:48:46,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:48:46,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 01:48:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:48:46,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 01:48:46,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:48:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:46,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:48:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:46,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417040178] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:48:46,647 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:48:46,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 01:48:46,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368981759] [2021-12-17 01:48:46,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:48:46,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 01:48:46,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:48:46,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 01:48:46,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 01:48:46,649 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:48:46,708 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-12-17 01:48:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 01:48:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-17 01:48:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:48:46,709 INFO L225 Difference]: With dead ends: 39 [2021-12-17 01:48:46,710 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 01:48:46,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-17 01:48:46,711 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 01:48:46,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 01:48:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 01:48:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-17 01:48:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) [2021-12-17 01:48:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-17 01:48:46,715 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-12-17 01:48:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:48:46,715 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-17 01:48:46,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-17 01:48:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 01:48:46,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:48:46,716 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:48:46,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 01:48:46,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:48:46,924 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:48:46,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:48:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 2 times [2021-12-17 01:48:46,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:48:46,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096413751] [2021-12-17 01:48:46,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:48:46,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:48:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:48:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:47,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:48:47,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096413751] [2021-12-17 01:48:47,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096413751] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:48:47,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594196717] [2021-12-17 01:48:47,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 01:48:47,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:48:47,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:48:47,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:48:47,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 01:48:47,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 01:48:47,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:48:47,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-17 01:48:47,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:48:47,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 01:48:47,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:48:47,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 01:48:47,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:48:47,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2021-12-17 01:48:49,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:48:49,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2021-12-17 01:48:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:49,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:48:50,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_71 Int)) (or (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_71)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_71) c_~N~0) (< 0 v_ArrVal_71))) is different from false [2021-12-17 01:48:52,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2021-12-17 01:48:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-17 01:48:52,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594196717] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:48:52,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:48:52,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2021-12-17 01:48:52,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071734074] [2021-12-17 01:48:52,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:48:52,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 01:48:52,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:48:52,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 01:48:52,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=491, Unknown=5, NotChecked=46, Total=650 [2021-12-17 01:48:52,732 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:48:53,049 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2021-12-17 01:48:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 01:48:53,049 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-17 01:48:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:48:53,050 INFO L225 Difference]: With dead ends: 40 [2021-12-17 01:48:53,050 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 01:48:53,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=205, Invalid=850, Unknown=5, NotChecked=62, Total=1122 [2021-12-17 01:48:53,051 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:48:53,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 67 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 190 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2021-12-17 01:48:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 01:48:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2021-12-17 01:48:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 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) [2021-12-17 01:48:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-17 01:48:53,054 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2021-12-17 01:48:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:48:53,054 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-17 01:48:53,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-17 01:48:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 01:48:53,054 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:48:53,054 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:48:53,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 01:48:53,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:48:53,255 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:48:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:48:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -301520475, now seen corresponding path program 3 times [2021-12-17 01:48:53,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:48:53,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145228799] [2021-12-17 01:48:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:48:53,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:48:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:48:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:53,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:48:53,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145228799] [2021-12-17 01:48:53,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145228799] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:48:53,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45784681] [2021-12-17 01:48:53,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 01:48:53,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:48:53,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:48:53,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:48:53,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 01:48:53,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 01:48:53,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:48:53,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 01:48:53,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:48:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:53,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:48:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:53,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45784681] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:48:53,477 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:48:53,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 01:48:53,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274237004] [2021-12-17 01:48:53,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:48:53,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 01:48:53,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:48:53,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 01:48:53,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 01:48:53,479 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:48:53,562 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2021-12-17 01:48:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 01:48:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-17 01:48:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:48:53,563 INFO L225 Difference]: With dead ends: 56 [2021-12-17 01:48:53,563 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 01:48:53,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-17 01:48:53,564 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:48:53,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 44 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 01:48:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 01:48:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2021-12-17 01:48:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-17 01:48:53,574 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-17 01:48:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:48:53,574 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-17 01:48:53,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:48:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-17 01:48:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 01:48:53,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:48:53,575 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:48:53,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 01:48:53,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:48:53,787 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:48:53,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:48:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1384678109, now seen corresponding path program 4 times [2021-12-17 01:48:53,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:48:53,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050541975] [2021-12-17 01:48:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:48:53,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:48:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:48:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:54,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:48:54,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050541975] [2021-12-17 01:48:54,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050541975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:48:54,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135317612] [2021-12-17 01:48:54,227 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 01:48:54,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:48:54,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:48:54,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:48:54,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 01:48:54,268 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 01:48:54,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:48:54,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-17 01:48:54,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:48:54,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 01:48:54,393 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-17 01:48:54,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 01:48:54,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:48:54,507 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 01:48:54,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 01:48:54,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:48:54,616 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-12-17 01:48:54,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 51 [2021-12-17 01:48:54,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:48:54,738 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 01:48:54,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 40 [2021-12-17 01:48:54,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:48:54,863 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 01:48:54,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 15 [2021-12-17 01:48:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:48:54,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:48:56,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_144 Int) (v_ArrVal_142 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (or (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_144)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 8)) v_ArrVal_144) c_~N~0) (< 0 v_ArrVal_142) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_142)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_142) v_ArrVal_144)))) is different from false [2021-12-17 01:48:58,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_144 Int) (v_ArrVal_142 Int) (v_ArrVal_140 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 v_ArrVal_142) (< (+ v_ArrVal_142 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_142)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_144) (let ((.cse2 (mod |c_ULTIMATE.start_main_~i~0#1| 2))) (and (< .cse2 (+ v_ArrVal_140 2)) (or (< .cse2 v_ArrVal_140) (and (< |c_ULTIMATE.start_main_~i~0#1| 0) (not (= 0 .cse2)))))) (<= (+ v_ArrVal_144 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_144)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (+ |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from false [2021-12-17 01:48:59,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_144 Int) (v_ArrVal_142 Int) (v_ArrVal_140 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_140)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< 0 v_ArrVal_142) (<= (+ v_ArrVal_144 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_144)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse2 (mod .cse3 2))) (and (or (< .cse2 v_ArrVal_140) (and (not (= 0 .cse2)) (< .cse3 0))) (< .cse2 (+ v_ArrVal_140 2))))) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_142)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_142) v_ArrVal_144))))) is different from false [2021-12-17 01:49:00,004 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 01:49:00,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 657 treesize of output 639 [2021-12-17 01:49:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-17 01:49:00,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135317612] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:49:00,495 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:49:00,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 40 [2021-12-17 01:49:00,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104305109] [2021-12-17 01:49:00,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:49:00,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-17 01:49:00,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:49:00,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-17 01:49:00,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1172, Unknown=3, NotChecked=216, Total=1560 [2021-12-17 01:49:00,501 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 40 states, 40 states have (on average 1.675) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:49:01,560 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2021-12-17 01:49:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-17 01:49:01,561 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 01:49:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:49:01,562 INFO L225 Difference]: With dead ends: 71 [2021-12-17 01:49:01,562 INFO L226 Difference]: Without dead ends: 58 [2021-12-17 01:49:01,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=481, Invalid=3310, Unknown=3, NotChecked=366, Total=4160 [2021-12-17 01:49:01,563 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 01:49:01,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 130 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 304 Invalid, 0 Unknown, 221 Unchecked, 0.2s Time] [2021-12-17 01:49:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-17 01:49:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2021-12-17 01:49:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2021-12-17 01:49:01,570 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 26 [2021-12-17 01:49:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:49:01,570 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2021-12-17 01:49:01,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2021-12-17 01:49:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 01:49:01,571 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:49:01,571 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:49:01,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 01:49:01,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:49:01,783 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:49:01,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:49:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash -483356095, now seen corresponding path program 5 times [2021-12-17 01:49:01,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:49:01,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806595282] [2021-12-17 01:49:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:49:01,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:49:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:49:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:49:01,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:49:01,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806595282] [2021-12-17 01:49:01,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806595282] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:49:01,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092899242] [2021-12-17 01:49:01,845 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 01:49:01,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:49:01,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:49:01,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:49:01,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 01:49:01,910 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-17 01:49:01,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:49:01,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 01:49:01,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:49:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:49:02,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:49:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:49:02,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092899242] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:49:02,051 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:49:02,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 01:49:02,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628348839] [2021-12-17 01:49:02,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:49:02,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 01:49:02,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:49:02,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 01:49:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 01:49:02,052 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:49:02,141 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2021-12-17 01:49:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 01:49:02,141 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-17 01:49:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:49:02,142 INFO L225 Difference]: With dead ends: 56 [2021-12-17 01:49:02,143 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 01:49:02,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-17 01:49:02,143 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:49:02,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 31 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 01:49:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 01:49:02,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-12-17 01:49:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2021-12-17 01:49:02,147 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2021-12-17 01:49:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:49:02,147 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2021-12-17 01:49:02,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2021-12-17 01:49:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 01:49:02,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:49:02,148 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:49:02,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 01:49:02,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:49:02,363 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:49:02,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:49:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1023492733, now seen corresponding path program 6 times [2021-12-17 01:49:02,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:49:02,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619861919] [2021-12-17 01:49:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:49:02,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:49:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:49:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:49:03,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:49:03,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619861919] [2021-12-17 01:49:03,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619861919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:49:03,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405534201] [2021-12-17 01:49:03,042 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 01:49:03,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:49:03,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:49:03,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:49:03,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 01:49:03,123 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-17 01:49:03,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:49:03,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-17 01:49:03,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:49:03,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-17 01:49:03,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 01:49:03,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:03,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:49:03,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:03,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:03,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2021-12-17 01:49:03,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:03,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:03,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:03,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 77 [2021-12-17 01:49:04,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:49:04,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:04,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:04,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:04,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2021-12-17 01:49:04,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:04,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:04,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:49:04,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:04,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 90 [2021-12-17 01:49:05,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:05,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:05,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:49:05,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:05,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 83 [2021-12-17 01:49:05,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:05,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:05,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:05,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 34 [2021-12-17 01:49:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:49:05,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:49:32,572 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-17 01:49:32,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14550 treesize of output 14358 [2021-12-17 01:49:40,963 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 01:49:40,963 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 01:49:40,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-12-17 01:49:40,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75002201] [2021-12-17 01:49:40,963 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 01:49:40,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 01:49:40,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:49:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 01:49:40,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=2420, Unknown=9, NotChecked=0, Total=2862 [2021-12-17 01:49:40,965 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:49:42,563 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2021-12-17 01:49:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-17 01:49:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-17 01:49:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:49:42,564 INFO L225 Difference]: With dead ends: 66 [2021-12-17 01:49:42,564 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 01:49:42,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=671, Invalid=3742, Unknown=9, NotChecked=0, Total=4422 [2021-12-17 01:49:42,566 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 01:49:42,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 61 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 01:49:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 01:49:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-17 01:49:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2021-12-17 01:49:42,570 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 31 [2021-12-17 01:49:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:49:42,570 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2021-12-17 01:49:42,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2021-12-17 01:49:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-17 01:49:42,571 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:49:42,571 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:49:42,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 01:49:42,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:49:42,787 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:49:42,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:49:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash -403759035, now seen corresponding path program 7 times [2021-12-17 01:49:42,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:49:42,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263459308] [2021-12-17 01:49:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:49:42,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:49:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:49:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:49:42,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:49:42,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263459308] [2021-12-17 01:49:42,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263459308] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:49:42,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609589702] [2021-12-17 01:49:42,897 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 01:49:42,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:49:42,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:49:42,898 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:49:42,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 01:49:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:49:42,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 01:49:42,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:49:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:49:43,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:49:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:49:43,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609589702] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 01:49:43,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 01:49:43,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-17 01:49:43,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491509789] [2021-12-17 01:49:43,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 01:49:43,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 01:49:43,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 01:49:43,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 01:49:43,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-17 01:49:43,152 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 01:49:43,351 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2021-12-17 01:49:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 01:49:43,352 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-17 01:49:43,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 01:49:43,352 INFO L225 Difference]: With dead ends: 54 [2021-12-17 01:49:43,352 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 01:49:43,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2021-12-17 01:49:43,353 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 81 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 01:49:43,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 28 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 01:49:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 01:49:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2021-12-17 01:49:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-12-17 01:49:43,356 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2021-12-17 01:49:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 01:49:43,356 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-12-17 01:49:43,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 01:49:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-12-17 01:49:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 01:49:43,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 01:49:43,357 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 01:49:43,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 01:49:43,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:49:43,564 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 01:49:43,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 01:49:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash -880704545, now seen corresponding path program 8 times [2021-12-17 01:49:43,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 01:49:43,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823729991] [2021-12-17 01:49:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 01:49:43,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 01:49:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 01:49:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:49:44,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 01:49:44,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823729991] [2021-12-17 01:49:44,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823729991] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 01:49:44,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893668837] [2021-12-17 01:49:44,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 01:49:44,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 01:49:44,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 01:49:44,404 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 01:49:44,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 01:49:44,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 01:49:44,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 01:49:44,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-17 01:49:44,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 01:49:44,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 01:49:44,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:44,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-17 01:49:44,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:44,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:44,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:44,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2021-12-17 01:49:44,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:44,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:44,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:44,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:44,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:44,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:44,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2021-12-17 01:49:45,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2021-12-17 01:49:45,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:49:45,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2021-12-17 01:49:45,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:49:45,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2021-12-17 01:49:45,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 01:49:45,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 71 [2021-12-17 01:49:45,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2021-12-17 01:49:45,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 01:49:45,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2021-12-17 01:49:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 01:49:45,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 01:50:58,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_349 Int) (v_ArrVal_347 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_344) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_346))))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_347) v_ArrVal_349) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)) v_ArrVal_353) .cse2) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_349)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) v_ArrVal_349) v_ArrVal_351) (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse3 (mod .cse4 2))) (and (< .cse3 (+ v_ArrVal_344 2)) (or (and (not (= 0 .cse3)) (< .cse4 0)) (< .cse3 v_ArrVal_344))))) (let ((.cse5 (mod |c_ULTIMATE.start_main_~i~0#1| 2))) (and (< .cse5 (+ v_ArrVal_346 2)) (or (and (not (= 0 .cse5)) (< .cse2 0)) (< .cse5 v_ArrVal_346)))) (< (+ v_ArrVal_351 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_351)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))) v_ArrVal_353) (< 0 v_ArrVal_347))))) is different from false [2021-12-17 01:51:30,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_353 Int) (v_ArrVal_341 Int) (v_ArrVal_351 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_349 Int) (v_ArrVal_347 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_341) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_344) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_346)))) (.cse6 (mod |c_ULTIMATE.start_main_~i~0#1| 2))) (let ((.cse5 (not (= 0 .cse6))) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_349)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) v_ArrVal_349) v_ArrVal_351) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_351)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) v_ArrVal_351) v_ArrVal_353) (<= (+ v_ArrVal_353 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16))) .cse2) (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse3 (mod .cse4 2))) (and (< .cse3 (+ v_ArrVal_344 2)) (or (and (not (= 0 .cse3)) (< .cse4 0)) (< .cse3 v_ArrVal_344))))) (and (or (and (< |c_ULTIMATE.start_main_~i~0#1| 0) .cse5) (< .cse6 v_ArrVal_341)) (< .cse6 (+ v_ArrVal_341 2))) (and (< .cse6 (+ v_ArrVal_346 2)) (or (and .cse5 (< .cse2 0)) (< .cse6 v_ArrVal_346))) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_347) v_ArrVal_349) (< 0 v_ArrVal_347))))) is different from false [2021-12-17 01:52:09,780 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (v_ArrVal_353 Int) (v_ArrVal_341 Int) (v_ArrVal_351 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_349 Int) (v_ArrVal_347 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse4 (mod .cse6 2)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_341) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_344) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 12) v_ArrVal_346))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (.cse5 (not (= 0 .cse4)))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_351)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) v_ArrVal_351) v_ArrVal_353) (let ((.cse2 (mod |c_ULTIMATE.start_main_~i~0#1| 2))) (and (< .cse2 (+ v_ArrVal_344 2)) (or (< .cse2 v_ArrVal_344) (and (not (= 0 .cse2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) 0))))) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_347) v_ArrVal_349) (<= (+ v_ArrVal_353 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_353)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16))) .cse3) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_349)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) v_ArrVal_349) v_ArrVal_351) (and (or (< .cse4 v_ArrVal_346) (and (< .cse3 0) .cse5)) (< .cse4 (+ v_ArrVal_346 2))) (and (< .cse4 (+ v_ArrVal_341 2)) (or (and .cse5 (< .cse6 0)) (< .cse4 v_ArrVal_341))) (< 0 v_ArrVal_347)))))) is different from false [2021-12-17 01:52:09,880 INFO L354 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2021-12-17 01:52:09,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 920311 treesize of output 914131 Killed by 15