./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condg.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/condg.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:38:48,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:38:48,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:38:48,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:38:48,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:38:48,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:38:48,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:38:48,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:38:48,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:38:48,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:38:48,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:38:48,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:38:48,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:38:48,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:38:48,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:38:48,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:38:48,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:38:48,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:38:48,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:38:48,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:38:48,964 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:38:48,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:38:48,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:38:48,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:38:48,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:38:48,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:38:48,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:38:48,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:38:48,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:38:48,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:38:48,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:38:48,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:38:48,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:38:48,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:38:48,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:38:48,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:38:48,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:38:48,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:38:48,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:38:48,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:38:48,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:38:48,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:38:48,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:38:49,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:38:49,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:38:49,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:38:49,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:38:49,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:38:49,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:38:49,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:38:49,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:38:49,022 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:38:49,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:38:49,023 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:38:49,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:38:49,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:38:49,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:38:49,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:38:49,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:38:49,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:38:49,025 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:38:49,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:38:49,025 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:38:49,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:38:49,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:38:49,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:38:49,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:38:49,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:38:49,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:38:49,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:38:49,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:38:49,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:38:49,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:38:49,027 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:38:49,028 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:38:49,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:38:49,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 [2022-07-22 10:38:49,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:38:49,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:38:49,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:38:49,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:38:49,286 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:38:49,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condg.c [2022-07-22 10:38:49,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418136340/e3892b844f9e4f9bb5f7f9b78f9be6f6/FLAG9ae881b3a [2022-07-22 10:38:49,674 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:38:49,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c [2022-07-22 10:38:49,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418136340/e3892b844f9e4f9bb5f7f9b78f9be6f6/FLAG9ae881b3a [2022-07-22 10:38:50,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418136340/e3892b844f9e4f9bb5f7f9b78f9be6f6 [2022-07-22 10:38:50,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:38:50,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:38:50,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:38:50,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:38:50,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:38:50,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5878501f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50, skipping insertion in model container [2022-07-22 10:38:50,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:38:50,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:38:50,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c[588,601] [2022-07-22 10:38:50,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:38:50,277 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:38:50,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c[588,601] [2022-07-22 10:38:50,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:38:50,304 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:38:50,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50 WrapperNode [2022-07-22 10:38:50,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:38:50,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:38:50,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:38:50,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:38:50,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,334 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-07-22 10:38:50,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:38:50,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:38:50,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:38:50,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:38:50,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:38:50,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:38:50,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:38:50,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:38:50,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (1/1) ... [2022-07-22 10:38:50,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:38:50,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:50,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 10:38:50,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 10:38:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:38:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:38:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:38:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:38:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:38:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:38:50,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:38:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:38:50,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:38:50,489 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:38:50,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:38:50,608 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:38:50,614 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:38:50,614 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 10:38:50,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:38:50 BoogieIcfgContainer [2022-07-22 10:38:50,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:38:50,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:38:50,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:38:50,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:38:50,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:38:50" (1/3) ... [2022-07-22 10:38:50,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cbc367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:38:50, skipping insertion in model container [2022-07-22 10:38:50,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:50" (2/3) ... [2022-07-22 10:38:50,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cbc367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:38:50, skipping insertion in model container [2022-07-22 10:38:50,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:38:50" (3/3) ... [2022-07-22 10:38:50,624 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2022-07-22 10:38:50,636 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:38:50,637 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:38:50,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:38:50,684 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@230ca6fd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ff4ace2 [2022-07-22 10:38:50,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:38:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 10:38:50,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:50,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:50,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:50,719 INFO L85 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2022-07-22 10:38:50,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:50,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185423625] [2022-07-22 10:38:50,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:50,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:38:50,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:50,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185423625] [2022-07-22 10:38:50,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185423625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:38:50,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:38:50,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:38:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635247432] [2022-07-22 10:38:50,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:38:50,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:38:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:50,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:38:50,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:38:50,952 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:50,971 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-07-22 10:38:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:38:50,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 10:38:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:50,981 INFO L225 Difference]: With dead ends: 46 [2022-07-22 10:38:50,982 INFO L226 Difference]: Without dead ends: 21 [2022-07-22 10:38:50,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:38:50,994 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:50,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:38:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-22 10:38:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-22 10:38:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-22 10:38:51,024 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-07-22 10:38:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:51,025 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-22 10:38:51,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-22 10:38:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 10:38:51,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:51,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:51,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:38:51,028 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2022-07-22 10:38:51,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:51,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679496244] [2022-07-22 10:38:51,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:51,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:38:51,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:51,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679496244] [2022-07-22 10:38:51,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679496244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:38:51,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:38:51,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:38:51,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001487799] [2022-07-22 10:38:51,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:38:51,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:38:51,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:51,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:38:51,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:38:51,185 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:51,270 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-07-22 10:38:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:38:51,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 10:38:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:51,273 INFO L225 Difference]: With dead ends: 48 [2022-07-22 10:38:51,273 INFO L226 Difference]: Without dead ends: 34 [2022-07-22 10:38:51,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:38:51,278 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:51,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:38:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-22 10:38:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2022-07-22 10:38:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-22 10:38:51,288 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2022-07-22 10:38:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:51,288 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-22 10:38:51,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-22 10:38:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 10:38:51,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:51,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:51,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:38:51,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2022-07-22 10:38:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:51,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694594904] [2022-07-22 10:38:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:38:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:51,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694594904] [2022-07-22 10:38:51,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694594904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:38:51,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619663282] [2022-07-22 10:38:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:51,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:51,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:51,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:38:51,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 10:38:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:51,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-22 10:38:51,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:38:51,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:38:51,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 10:38:51,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:38:51,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 20 [2022-07-22 10:38:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:38:51,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:38:52,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_44 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_44) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)) is different from false [2022-07-22 10:38:52,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:38:52,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-22 10:38:52,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:38:52,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-22 10:38:52,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-22 10:38:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 10:38:52,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619663282] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:38:52,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:38:52,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-07-22 10:38:52,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604859120] [2022-07-22 10:38:52,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:38:52,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:38:52,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:52,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:38:52,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2022-07-22 10:38:52,114 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:52,402 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-07-22 10:38:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:38:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-22 10:38:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:52,404 INFO L225 Difference]: With dead ends: 56 [2022-07-22 10:38:52,404 INFO L226 Difference]: Without dead ends: 54 [2022-07-22 10:38:52,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=370, Unknown=1, NotChecked=40, Total=506 [2022-07-22 10:38:52,406 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:52,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 96 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 158 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-07-22 10:38:52,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-22 10:38:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2022-07-22 10:38:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-07-22 10:38:52,414 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2022-07-22 10:38:52,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:52,414 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-22 10:38:52,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-07-22 10:38:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 10:38:52,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:52,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:52,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 10:38:52,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:52,632 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2022-07-22 10:38:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:52,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262473132] [2022-07-22 10:38:52,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:38:52,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:52,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262473132] [2022-07-22 10:38:52,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262473132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:38:52,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313254268] [2022-07-22 10:38:52,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:52,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:52,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:52,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:38:52,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 10:38:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:53,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 10:38:53,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:38:53,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:38:53,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:38:53,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:38:53,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-22 10:38:53,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 10:38:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:38:53,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:38:53,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:38:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:38:53,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313254268] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:38:53,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:38:53,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-07-22 10:38:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303467991] [2022-07-22 10:38:53,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:38:53,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 10:38:53,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:53,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 10:38:53,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-07-22 10:38:53,438 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:53,676 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-07-22 10:38:53,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 10:38:53,676 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-22 10:38:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:53,677 INFO L225 Difference]: With dead ends: 66 [2022-07-22 10:38:53,677 INFO L226 Difference]: Without dead ends: 56 [2022-07-22 10:38:53,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-07-22 10:38:53,679 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:53,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-07-22 10:38:53,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-22 10:38:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-07-22 10:38:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-07-22 10:38:53,687 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 21 [2022-07-22 10:38:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:53,688 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-07-22 10:38:53,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-07-22 10:38:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 10:38:53,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:53,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:53,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 10:38:53,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 10:38:53,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1912499326, now seen corresponding path program 2 times [2022-07-22 10:38:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:53,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310993431] [2022-07-22 10:38:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:53,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:38:53,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310993431] [2022-07-22 10:38:53,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310993431] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:38:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212136436] [2022-07-22 10:38:53,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:38:53,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:53,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:53,976 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:38:53,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 10:38:54,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:38:54,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:38:54,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:38:54,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:38:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:38:54,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:38:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:38:54,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212136436] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:38:54,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:38:54,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-07-22 10:38:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679236682] [2022-07-22 10:38:54,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:38:54,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:38:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:54,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:38:54,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:38:54,125 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:54,364 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-07-22 10:38:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 10:38:54,365 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-22 10:38:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:54,366 INFO L225 Difference]: With dead ends: 93 [2022-07-22 10:38:54,366 INFO L226 Difference]: Without dead ends: 55 [2022-07-22 10:38:54,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-07-22 10:38:54,367 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 161 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:54,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 82 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:38:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-22 10:38:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-07-22 10:38:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-07-22 10:38:54,373 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2022-07-22 10:38:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:54,373 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-07-22 10:38:54,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-07-22 10:38:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 10:38:54,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:54,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:54,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 10:38:54,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:54,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash 550852762, now seen corresponding path program 1 times [2022-07-22 10:38:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:54,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919176796] [2022-07-22 10:38:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 10:38:54,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:54,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919176796] [2022-07-22 10:38:54,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919176796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:38:54,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217773961] [2022-07-22 10:38:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:54,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:54,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:54,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:38:54,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 10:38:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:54,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 10:38:54,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:38:54,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:38:54,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:38:54,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-22 10:38:54,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 10:38:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:38:54,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:38:54,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-22 10:38:54,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-22 10:38:54,815 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:38:54,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 10:38:54,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 10:38:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2022-07-22 10:38:54,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217773961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:38:54,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:38:54,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2022-07-22 10:38:54,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750534692] [2022-07-22 10:38:54,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:38:54,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:38:54,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:54,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:38:54,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-22 10:38:54,834 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:54,907 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-07-22 10:38:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 10:38:54,907 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-22 10:38:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:54,908 INFO L225 Difference]: With dead ends: 50 [2022-07-22 10:38:54,908 INFO L226 Difference]: Without dead ends: 40 [2022-07-22 10:38:54,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2022-07-22 10:38:54,909 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:54,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-07-22 10:38:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-22 10:38:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-22 10:38:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-07-22 10:38:54,921 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 28 [2022-07-22 10:38:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:54,924 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-07-22 10:38:54,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:38:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-07-22 10:38:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 10:38:54,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:54,926 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:54,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 10:38:55,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:55,151 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1969107172, now seen corresponding path program 3 times [2022-07-22 10:38:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:55,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199261732] [2022-07-22 10:38:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:38:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:55,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199261732] [2022-07-22 10:38:55,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199261732] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:38:55,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061400506] [2022-07-22 10:38:55,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:38:55,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:55,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:55,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:38:55,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 10:38:55,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:38:55,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:38:55,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 10:38:55,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:38:55,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:38:55,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:38:55,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:38:56,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:38:56,074 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-22 10:38:56,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-22 10:38:56,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:38:56,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:38:56,258 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 10:38:56,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 41 [2022-07-22 10:38:56,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:38:56,381 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-22 10:38:56,382 INFO L390 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 55 treesize of output 48 [2022-07-22 10:38:56,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:38:56,658 INFO L356 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-07-22 10:38:56,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-07-22 10:38:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:38:56,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:39:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:39:49,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061400506] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:39:49,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:39:49,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 46 [2022-07-22 10:39:49,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464230389] [2022-07-22 10:39:49,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:39:49,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-22 10:39:49,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:39:49,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-22 10:39:49,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1761, Unknown=19, NotChecked=0, Total=2070 [2022-07-22 10:39:49,180 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:31,914 WARN L233 SmtUtils]: Spent 21.66s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:40:49,092 WARN L233 SmtUtils]: Spent 12.10s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:40:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:40:49,638 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-07-22 10:40:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 10:40:49,639 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-22 10:40:49,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:40:49,640 INFO L225 Difference]: With dead ends: 79 [2022-07-22 10:40:49,640 INFO L226 Difference]: Without dead ends: 64 [2022-07-22 10:40:49,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 113.1s TimeCoverageRelationStatistics Valid=500, Invalid=3128, Unknown=32, NotChecked=0, Total=3660 [2022-07-22 10:40:49,642 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:40:49,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 150 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 263 Unchecked, 0.1s Time] [2022-07-22 10:40:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-22 10:40:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-07-22 10:40:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-07-22 10:40:49,651 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2022-07-22 10:40:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:40:49,651 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-07-22 10:40:49,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-07-22 10:40:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 10:40:49,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:40:49,652 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:40:49,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 10:40:49,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:40:49,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:40:49,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:40:49,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1202810022, now seen corresponding path program 4 times [2022-07-22 10:40:49,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:40:49,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586579197] [2022-07-22 10:40:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:40:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:40:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:40:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:40:49,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:40:49,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586579197] [2022-07-22 10:40:49,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586579197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:40:49,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970404830] [2022-07-22 10:40:49,926 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:40:49,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:40:49,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:40:49,928 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:40:49,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 10:40:49,985 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:40:49,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:40:49,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:40:49,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:40:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:40:50,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:40:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:40:50,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970404830] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:40:50,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:40:50,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:40:50,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453989994] [2022-07-22 10:40:50,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:40:50,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:40:50,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:40:50,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:40:50,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:40:50,072 INFO L87 Difference]: Start difference. First operand 55 states and 66 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) [2022-07-22 10:40:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:40:50,232 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2022-07-22 10:40:50,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:40:50,233 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-22 10:40:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:40:50,234 INFO L225 Difference]: With dead ends: 142 [2022-07-22 10:40:50,234 INFO L226 Difference]: Without dead ends: 113 [2022-07-22 10:40:50,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:40:50,235 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 118 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:40:50,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 70 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:40:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-22 10:40:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 85. [2022-07-22 10:40:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 84 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2022-07-22 10:40:50,248 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 30 [2022-07-22 10:40:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:40:50,249 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2022-07-22 10:40:50,249 INFO L496 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) [2022-07-22 10:40:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2022-07-22 10:40:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:40:50,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:40:50,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:40:50,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 10:40:50,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:40:50,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:40:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:40:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash -736332014, now seen corresponding path program 1 times [2022-07-22 10:40:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:40:50,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283536561] [2022-07-22 10:40:50,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:40:50,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:40:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:40:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:40:51,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:40:51,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283536561] [2022-07-22 10:40:51,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283536561] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:40:51,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769072228] [2022-07-22 10:40:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:40:51,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:40:51,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:40:51,062 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:40:51,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 10:40:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:40:51,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-22 10:40:51,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:40:51,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:40:51,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:51,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:40:51,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:51,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:51,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-22 10:40:51,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:40:51,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:51,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:51,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-22 10:40:51,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:51,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:51,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-07-22 10:40:51,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:51,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:51,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:40:51,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2022-07-22 10:40:51,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:51,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-07-22 10:40:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:40:51,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:40:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:40:52,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769072228] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:40:52,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:40:52,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 50 [2022-07-22 10:40:52,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345507631] [2022-07-22 10:40:52,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:40:52,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-22 10:40:52,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:40:52,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-22 10:40:52,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2182, Unknown=0, NotChecked=0, Total=2450 [2022-07-22 10:40:52,504 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:40:54,412 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-07-22 10:40:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-22 10:40:54,412 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 10:40:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:40:54,413 INFO L225 Difference]: With dead ends: 106 [2022-07-22 10:40:54,413 INFO L226 Difference]: Without dead ends: 89 [2022-07-22 10:40:54,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=900, Invalid=5580, Unknown=0, NotChecked=0, Total=6480 [2022-07-22 10:40:54,415 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 87 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 10:40:54,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 227 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 436 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2022-07-22 10:40:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-22 10:40:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-07-22 10:40:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.186046511627907) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-07-22 10:40:54,434 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 32 [2022-07-22 10:40:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:40:54,434 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-07-22 10:40:54,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-07-22 10:40:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:40:54,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:40:54,436 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:40:54,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 10:40:54,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:40:54,643 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:40:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:40:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash -35267436, now seen corresponding path program 1 times [2022-07-22 10:40:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:40:54,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810555663] [2022-07-22 10:40:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:40:54,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:40:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:40:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 10:40:54,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:40:54,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810555663] [2022-07-22 10:40:54,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810555663] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:40:54,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068666582] [2022-07-22 10:40:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:40:54,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:40:54,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:40:54,706 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:40:54,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 10:40:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:40:54,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 10:40:54,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:40:54,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:40:54,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:54,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:40:54,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 10:40:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 10:40:54,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:40:54,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-22 10:40:54,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-22 10:40:54,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:40:54,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 10:40:54,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 10:40:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2022-07-22 10:40:54,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068666582] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:40:54,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:40:54,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2022-07-22 10:40:54,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847427342] [2022-07-22 10:40:54,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:40:54,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:40:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:40:54,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:40:54,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-22 10:40:54,879 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:40:54,951 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-07-22 10:40:54,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 10:40:54,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 10:40:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:40:54,952 INFO L225 Difference]: With dead ends: 101 [2022-07-22 10:40:54,952 INFO L226 Difference]: Without dead ends: 68 [2022-07-22 10:40:54,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2022-07-22 10:40:54,953 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:40:54,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-07-22 10:40:54,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-22 10:40:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-22 10:40:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-07-22 10:40:54,965 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 32 [2022-07-22 10:40:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:40:54,966 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-07-22 10:40:54,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-07-22 10:40:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:40:54,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:40:54,968 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:40:54,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 10:40:55,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 10:40:55,172 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:40:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:40:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash -767176616, now seen corresponding path program 5 times [2022-07-22 10:40:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:40:55,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034822030] [2022-07-22 10:40:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:40:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:40:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:40:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:40:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:40:55,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034822030] [2022-07-22 10:40:55,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034822030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:40:55,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811024070] [2022-07-22 10:40:55,242 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:40:55,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:40:55,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:40:55,244 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:40:55,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 10:40:55,323 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 10:40:55,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:40:55,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:40:55,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:40:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:40:55,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:40:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:40:55,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811024070] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:40:55,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:40:55,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:40:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734994938] [2022-07-22 10:40:55,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:40:55,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:40:55,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:40:55,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:40:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:40:55,427 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:40:55,567 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-07-22 10:40:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 10:40:55,568 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 10:40:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:40:55,568 INFO L225 Difference]: With dead ends: 91 [2022-07-22 10:40:55,568 INFO L226 Difference]: Without dead ends: 74 [2022-07-22 10:40:55,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:40:55,569 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:40:55,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 65 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:40:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-22 10:40:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 41. [2022-07-22 10:40:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-22 10:40:55,584 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 32 [2022-07-22 10:40:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:40:55,585 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-22 10:40:55,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:40:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-22 10:40:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 10:40:55,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:40:55,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:40:55,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 10:40:55,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:40:55,791 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:40:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:40:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash -143226682, now seen corresponding path program 2 times [2022-07-22 10:40:55,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:40:55,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731348747] [2022-07-22 10:40:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:40:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:40:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:40:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:40:56,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:40:56,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731348747] [2022-07-22 10:40:56,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731348747] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:40:56,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169063059] [2022-07-22 10:40:56,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:40:56,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:40:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:40:56,172 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:40:56,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 10:40:56,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:40:56,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:40:56,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-22 10:40:56,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:40:56,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 10:40:56,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:56,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:40:56,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:56,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:40:56,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:56,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:40:56,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:56,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:40:56,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:56,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:40:56,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:40:56,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:40:56,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-07-22 10:40:56,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:56,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:40:56,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:40:56,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:40:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:40:56,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:40:58,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-07-22 10:41:04,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)))) is different from false [2022-07-22 10:41:06,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-22 10:41:07,968 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)) (= (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-22 10:41:08,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) is different from false [2022-07-22 10:41:08,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) is different from false [2022-07-22 10:41:08,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-22 10:41:08,134 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))))) is different from false [2022-07-22 10:41:08,171 INFO L356 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2022-07-22 10:41:08,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 73 [2022-07-22 10:41:08,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2022-07-22 10:41:08,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:08,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:08,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-22 10:41:08,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:41:08,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 176 [2022-07-22 10:41:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 22 not checked. [2022-07-22 10:41:08,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169063059] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:41:08,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:41:08,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 42 [2022-07-22 10:41:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861317164] [2022-07-22 10:41:08,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:41:08,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-22 10:41:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:41:08,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-22 10:41:08,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=947, Unknown=19, NotChecked=568, Total=1722 [2022-07-22 10:41:08,254 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:10,274 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))))) (or (= (select .cse0 0) 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 10:41:12,297 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (or (= (select .cse1 0) 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 10:41:20,612 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)) is different from false [2022-07-22 10:41:22,671 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 10:41:24,719 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 10:41:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:41:25,003 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-07-22 10:41:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-22 10:41:25,003 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-22 10:41:25,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:41:25,004 INFO L225 Difference]: With dead ends: 80 [2022-07-22 10:41:25,004 INFO L226 Difference]: Without dead ends: 78 [2022-07-22 10:41:25,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=484, Invalid=2403, Unknown=27, NotChecked=1508, Total=4422 [2022-07-22 10:41:25,005 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:41:25,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 217 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 343 Invalid, 0 Unknown, 492 Unchecked, 0.2s Time] [2022-07-22 10:41:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-22 10:41:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2022-07-22 10:41:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-22 10:41:25,013 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 35 [2022-07-22 10:41:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:41:25,013 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-22 10:41:25,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-22 10:41:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 10:41:25,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:41:25,014 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:41:25,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 10:41:25,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 10:41:25,219 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:41:25,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:41:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1123059706, now seen corresponding path program 2 times [2022-07-22 10:41:25,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:41:25,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545490084] [2022-07-22 10:41:25,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:41:25,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:41:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:41:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 10:41:25,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:41:25,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545490084] [2022-07-22 10:41:25,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545490084] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:41:25,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023534759] [2022-07-22 10:41:25,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:41:25,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:41:25,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:41:25,281 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:41:25,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 10:41:25,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:41:25,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:41:25,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 10:41:25,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:41:25,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:41:25,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:25,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-22 10:41:25,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:25,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-22 10:41:25,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 10:41:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:41:25,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:41:25,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) is different from false [2022-07-22 10:41:25,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-22 10:41:25,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-22 10:41:25,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:41:25,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 10:41:25,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 10:41:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2022-07-22 10:41:25,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023534759] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:41:25,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:41:25,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2022-07-22 10:41:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675679992] [2022-07-22 10:41:25,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:41:25,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 10:41:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:41:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 10:41:25,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=119, Unknown=3, NotChecked=72, Total=240 [2022-07-22 10:41:25,527 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:41:25,861 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-07-22 10:41:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 10:41:25,861 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-22 10:41:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:41:25,862 INFO L225 Difference]: With dead ends: 116 [2022-07-22 10:41:25,862 INFO L226 Difference]: Without dead ends: 100 [2022-07-22 10:41:25,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2022-07-22 10:41:25,863 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 112 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:41:25,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 158 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 279 Invalid, 0 Unknown, 239 Unchecked, 0.1s Time] [2022-07-22 10:41:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-22 10:41:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 52. [2022-07-22 10:41:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-22 10:41:25,870 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-07-22 10:41:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:41:25,871 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-22 10:41:25,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-22 10:41:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 10:41:25,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:41:25,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:41:25,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 10:41:26,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 10:41:26,080 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:41:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:41:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 651947656, now seen corresponding path program 6 times [2022-07-22 10:41:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:41:26,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668490770] [2022-07-22 10:41:26,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:41:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:41:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:41:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 10:41:26,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:41:26,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668490770] [2022-07-22 10:41:26,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668490770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:41:26,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670197285] [2022-07-22 10:41:26,929 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:41:26,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:41:26,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:41:26,932 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:41:26,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 10:41:27,013 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-22 10:41:27,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:41:27,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-22 10:41:27,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:41:27,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:41:27,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:41:27,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-22 10:41:27,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,219 INFO L390 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 47 treesize of output 52 [2022-07-22 10:41:27,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:27,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,413 INFO L390 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 58 treesize of output 51 [2022-07-22 10:41:27,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,539 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-22 10:41:27,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 60 [2022-07-22 10:41:27,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:27,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:27,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2022-07-22 10:41:27,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-07-22 10:41:27,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:27,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 25 [2022-07-22 10:41:27,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-22 10:41:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:41:28,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:41:28,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-22 10:41:28,211 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse2)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) is different from false [2022-07-22 10:41:28,892 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_179|)) (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse1 .cse2 .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_179| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (forall ((v_ArrVal_564 (Array Int Int))) (<= |c_ULTIMATE.start_main_~i~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse6 .cse7 .cse8)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_179|)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_179| 1))))) is different from false [2022-07-22 10:41:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 6 refuted. 2 times theorem prover too weak. 2 trivial. 12 not checked. [2022-07-22 10:41:40,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670197285] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:41:40,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:41:40,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 18] total 53 [2022-07-22 10:41:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818051405] [2022-07-22 10:41:40,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:41:40,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-22 10:41:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:41:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-22 10:41:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2187, Unknown=14, NotChecked=294, Total=2756 [2022-07-22 10:41:40,289 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:41,259 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) is different from false [2022-07-22 10:41:41,326 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)))) is different from false [2022-07-22 10:41:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:41:41,443 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-07-22 10:41:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 10:41:41,443 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-22 10:41:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:41:41,444 INFO L225 Difference]: With dead ends: 90 [2022-07-22 10:41:41,444 INFO L226 Difference]: Without dead ends: 72 [2022-07-22 10:41:41,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=402, Invalid=3508, Unknown=16, NotChecked=630, Total=4556 [2022-07-22 10:41:41,445 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:41:41,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 193 Invalid, 0 Unknown, 210 Unchecked, 0.1s Time] [2022-07-22 10:41:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-22 10:41:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-22 10:41:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-22 10:41:41,457 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 35 [2022-07-22 10:41:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:41:41,457 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-22 10:41:41,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-07-22 10:41:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 10:41:41,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:41:41,458 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:41:41,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 10:41:41,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 10:41:41,663 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:41:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:41:41,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1015472054, now seen corresponding path program 7 times [2022-07-22 10:41:41,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:41:41,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139163662] [2022-07-22 10:41:41,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:41:41,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:41:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:41:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:41:41,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:41:41,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139163662] [2022-07-22 10:41:41,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139163662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:41:41,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367069276] [2022-07-22 10:41:41,733 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:41:41,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:41:41,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:41:41,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:41:41,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 10:41:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:41:41,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:41:41,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:41:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:41:41,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:41:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:41:41,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367069276] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:41:41,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:41:41,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:41:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86416211] [2022-07-22 10:41:41,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:41:41,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:41:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:41:41,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:41:41,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:41:41,908 INFO L87 Difference]: Start difference. First operand 69 states and 80 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) [2022-07-22 10:41:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:41:42,298 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2022-07-22 10:41:42,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:41:42,298 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 37 [2022-07-22 10:41:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:41:42,299 INFO L225 Difference]: With dead ends: 173 [2022-07-22 10:41:42,299 INFO L226 Difference]: Without dead ends: 141 [2022-07-22 10:41:42,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-22 10:41:42,300 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 134 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:41:42,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 239 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 10:41:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-22 10:41:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 85. [2022-07-22 10:41:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2022-07-22 10:41:42,314 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 37 [2022-07-22 10:41:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:41:42,314 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2022-07-22 10:41:42,314 INFO L496 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) [2022-07-22 10:41:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2022-07-22 10:41:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 10:41:42,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:41:42,315 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:41:42,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 10:41:42,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 10:41:42,523 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:41:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:41:42,524 INFO L85 PathProgramCache]: Analyzing trace with hash -590527364, now seen corresponding path program 2 times [2022-07-22 10:41:42,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:41:42,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092128932] [2022-07-22 10:41:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:41:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:41:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:41:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:41:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:41:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092128932] [2022-07-22 10:41:43,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092128932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:41:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553982519] [2022-07-22 10:41:43,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:41:43,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:41:43,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:41:43,190 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:41:43,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 10:41:43,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:41:43,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:41:43,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-22 10:41:43,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:41:43,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:41:43,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:41:43,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-22 10:41:43,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,446 INFO L390 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 42 treesize of output 47 [2022-07-22 10:41:43,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:43,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,571 INFO L390 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 58 treesize of output 51 [2022-07-22 10:41:43,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:43,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,676 INFO L390 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 62 treesize of output 49 [2022-07-22 10:41:43,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 55 [2022-07-22 10:41:43,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:43,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:43,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2022-07-22 10:41:44,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:44,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:44,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:44,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2022-07-22 10:41:44,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:44,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:44,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:44,157 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-22 10:41:44,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-07-22 10:41:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:41:44,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:41:46,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) is different from false [2022-07-22 10:41:47,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)))) is different from false [2022-07-22 10:41:47,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_216|)) (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-22 10:41:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-22 10:41:52,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553982519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:41:52,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:41:52,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 23] total 67 [2022-07-22 10:41:52,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476134829] [2022-07-22 10:41:52,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:41:52,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-22 10:41:52,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:41:52,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-22 10:41:52,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=3525, Unknown=6, NotChecked=378, Total=4422 [2022-07-22 10:41:52,868 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:41:58,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (= (select .cse0 .cse1) 0))) (and (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (or (not (= .cse1 4)) .cse2) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))) .cse2 (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)))) is different from false [2022-07-22 10:41:58,644 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse2 4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 1))) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-22 10:42:00,708 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-22 10:42:39,517 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-22 10:42:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:42:41,230 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2022-07-22 10:42:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-22 10:42:41,231 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 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 39 [2022-07-22 10:42:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:42:41,231 INFO L225 Difference]: With dead ends: 129 [2022-07-22 10:42:41,231 INFO L226 Difference]: Without dead ends: 127 [2022-07-22 10:42:41,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3001 ImplicationChecksByTransitivity, 57.4s TimeCoverageRelationStatistics Valid=1287, Invalid=7980, Unknown=73, NotChecked=1372, Total=10712 [2022-07-22 10:42:41,234 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 396 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:42:41,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 304 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 476 Invalid, 0 Unknown, 396 Unchecked, 0.3s Time] [2022-07-22 10:42:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-22 10:42:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2022-07-22 10:42:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.19) internal successors, (119), 100 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:42:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2022-07-22 10:42:41,252 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 39 [2022-07-22 10:42:41,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:42:41,253 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2022-07-22 10:42:41,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:42:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2022-07-22 10:42:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 10:42:41,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:42:41,253 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:42:41,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-22 10:42:41,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:42:41,454 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:42:41,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:42:41,454 INFO L85 PathProgramCache]: Analyzing trace with hash 110537214, now seen corresponding path program 2 times [2022-07-22 10:42:41,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:42:41,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672248657] [2022-07-22 10:42:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:42:41,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:42:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:42:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:42:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:42:41,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672248657] [2022-07-22 10:42:41,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672248657] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:42:41,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186553331] [2022-07-22 10:42:41,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:42:41,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:42:41,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:42:41,535 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:42:41,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 10:42:41,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:42:41,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:42:41,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 10:42:41,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:42:41,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:42:41,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:41,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:42:41,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:41,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:42:41,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 10:42:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 10:42:41,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:42:41,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-22 10:42:41,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-22 10:42:41,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-22 10:42:41,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:42:41,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 10:42:41,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 10:42:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 12 not checked. [2022-07-22 10:42:41,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186553331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:42:41,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:42:41,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2022-07-22 10:42:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020255733] [2022-07-22 10:42:41,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:42:41,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 10:42:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:42:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 10:42:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=119, Unknown=3, NotChecked=72, Total=240 [2022-07-22 10:42:41,829 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:42:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:42:42,205 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-07-22 10:42:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 10:42:42,206 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 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 39 [2022-07-22 10:42:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:42:42,206 INFO L225 Difference]: With dead ends: 150 [2022-07-22 10:42:42,206 INFO L226 Difference]: Without dead ends: 136 [2022-07-22 10:42:42,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2022-07-22 10:42:42,207 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 87 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:42:42,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 165 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 317 Invalid, 0 Unknown, 191 Unchecked, 0.2s Time] [2022-07-22 10:42:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-22 10:42:42,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 96. [2022-07-22 10:42:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 95 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:42:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2022-07-22 10:42:42,225 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 39 [2022-07-22 10:42:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:42:42,225 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2022-07-22 10:42:42,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:42:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-07-22 10:42:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 10:42:42,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:42:42,225 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:42:42,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 10:42:42,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 10:42:42,426 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:42:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:42:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1487374188, now seen corresponding path program 8 times [2022-07-22 10:42:42,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:42:42,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880774838] [2022-07-22 10:42:42,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:42:42,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:42:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:42:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 10:42:43,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:42:43,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880774838] [2022-07-22 10:42:43,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880774838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:42:43,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488645560] [2022-07-22 10:42:43,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:42:43,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:42:43,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:42:43,998 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:42:43,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 10:42:44,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:42:44,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:42:44,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-22 10:42:44,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:42:44,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:42:44,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:42:44,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-22 10:42:44,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-22 10:42:44,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,382 INFO L390 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 [2022-07-22 10:42:44,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:42:44,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,603 INFO L390 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 67 treesize of output 63 [2022-07-22 10:42:44,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:42:44,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,743 INFO L390 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 71 treesize of output 61 [2022-07-22 10:42:44,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:42:44,875 INFO L390 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 68 [2022-07-22 10:42:44,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:44,994 INFO L390 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 65 treesize of output 57 [2022-07-22 10:42:45,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:45,086 INFO L390 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 51 treesize of output 23 [2022-07-22 10:42:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 10:42:45,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:42:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 10:42:47,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488645560] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:42:47,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:42:47,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 60 [2022-07-22 10:42:47,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989324208] [2022-07-22 10:42:47,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:42:47,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-22 10:42:47,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:42:47,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-22 10:42:47,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3268, Unknown=0, NotChecked=0, Total=3540 [2022-07-22 10:42:47,951 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:42:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:42:50,093 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2022-07-22 10:42:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 10:42:50,094 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 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 42 [2022-07-22 10:42:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:42:50,094 INFO L225 Difference]: With dead ends: 130 [2022-07-22 10:42:50,095 INFO L226 Difference]: Without dead ends: 112 [2022-07-22 10:42:50,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=346, Invalid=4210, Unknown=0, NotChecked=0, Total=4556 [2022-07-22 10:42:50,096 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-22 10:42:50,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 172 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 867 Invalid, 0 Unknown, 106 Unchecked, 1.5s Time] [2022-07-22 10:42:50,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-22 10:42:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2022-07-22 10:42:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:42:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-07-22 10:42:50,114 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 42 [2022-07-22 10:42:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:42:50,115 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-07-22 10:42:50,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:42:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-07-22 10:42:50,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 10:42:50,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:42:50,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:42:50,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-22 10:42:50,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 10:42:50,331 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:42:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:42:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2085827890, now seen corresponding path program 3 times [2022-07-22 10:42:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:42:50,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914281705] [2022-07-22 10:42:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:42:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:42:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:42:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:42:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:42:50,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914281705] [2022-07-22 10:42:50,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914281705] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:42:50,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887916108] [2022-07-22 10:42:50,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:42:50,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:42:50,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:42:50,932 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:42:50,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 10:42:51,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 10:42:51,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:42:51,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-22 10:42:51,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:42:51,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 10:42:51,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:51,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 10:42:51,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:51,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 10:42:51,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:42:51,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 10:42:51,396 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-22 10:42:51,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-07-22 10:42:51,459 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-22 10:42:51,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2022-07-22 10:42:51,608 INFO L356 Elim1Store]: treesize reduction 34, result has 48.5 percent of original size [2022-07-22 10:42:51,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 61 [2022-07-22 10:42:52,027 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-22 10:42:52,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 36 [2022-07-22 10:42:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:42:52,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:43:06,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 Int) (|v_ULTIMATE.start_main_~i~0#1_276| Int) (|v_ULTIMATE.start_main_~i~0#1_281| Int) (v_ArrVal_879 Int)) (or (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_281|) c_~N~0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_281| 1) c_~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_276| 1) c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_276| 1) (= (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_281| 4))) (let ((.cse0 (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_879)) (.cse2 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_880) .cse2 (+ (- 1) (select .cse0 .cse2))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_276| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-07-22 10:43:08,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_282| Int)) (or (forall ((v_ArrVal_880 Int) (|v_ULTIMATE.start_main_~i~0#1_276| Int) (|v_ULTIMATE.start_main_~i~0#1_281| Int) (v_ArrVal_879 Int)) (or (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_281|) c_~N~0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_281| 1) c_~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_276| 1) c_~N~0)) (< |v_ULTIMATE.start_main_~i~0#1_276| 1) (= (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_281| 4))) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_282| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_879)) (.cse2 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_880) .cse2 (+ (- 1) (select .cse0 .cse2))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_276| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (not (<= |v_ULTIMATE.start_main_~i~0#1_282| 0)))) is different from false