./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/forester-heap/sll-buckets-1.i -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 c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:05:56,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:05:56,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:05:56,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:05:56,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:05:56,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:05:56,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:05:56,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:05:56,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:05:56,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:05:56,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:05:56,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:05:56,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:05:56,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:05:56,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:05:56,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:05:56,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:05:56,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:05:56,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:05:56,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:05:56,258 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:05:56,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:05:56,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:05:56,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:05:56,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:05:56,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:05:56,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:05:56,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:05:56,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:05:56,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:05:56,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:05:56,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:05:56,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:05:56,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:05:56,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:05:56,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:05:56,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:05:56,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:05:56,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:05:56,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:05:56,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:05:56,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:05:56,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:05:56,311 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:05:56,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:05:56,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:05:56,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:05:56,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:05:56,313 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:05:56,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:05:56,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:05:56,314 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:05:56,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:05:56,314 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:05:56,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:05:56,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:05:56,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:05:56,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:05:56,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:05:56,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:05:56,316 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:05:56,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:05:56,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:05:56,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:05:56,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:05:56,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:05:56,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:05:56,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:05:56,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:05:56,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:05:56,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:05:56,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:05:56,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:05:56,318 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:05:56,318 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:05:56,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:05:56,318 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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2022-07-21 02:05:56,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:05:56,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:05:56,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:05:56,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:05:56,621 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:05:56,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2022-07-21 02:05:56,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e790621d3/1238890ff5cc49fe8a939b0e1ee5bc4b/FLAGc2555ef41 [2022-07-21 02:05:57,066 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:05:57,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2022-07-21 02:05:57,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e790621d3/1238890ff5cc49fe8a939b0e1ee5bc4b/FLAGc2555ef41 [2022-07-21 02:05:57,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e790621d3/1238890ff5cc49fe8a939b0e1ee5bc4b [2022-07-21 02:05:57,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:05:57,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:05:57,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:05:57,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:05:57,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:05:57,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a41efc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57, skipping insertion in model container [2022-07-21 02:05:57,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:05:57,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:05:57,716 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/forester-heap/sll-buckets-1.i[22663,22676] [2022-07-21 02:05:57,720 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/forester-heap/sll-buckets-1.i[22734,22747] [2022-07-21 02:05:57,721 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/forester-heap/sll-buckets-1.i[22862,22875] [2022-07-21 02:05:57,724 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/forester-heap/sll-buckets-1.i[23275,23288] [2022-07-21 02:05:57,724 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/forester-heap/sll-buckets-1.i[23364,23377] [2022-07-21 02:05:57,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:05:57,732 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:05:57,762 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/forester-heap/sll-buckets-1.i[22663,22676] [2022-07-21 02:05:57,763 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/forester-heap/sll-buckets-1.i[22734,22747] [2022-07-21 02:05:57,764 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/forester-heap/sll-buckets-1.i[22862,22875] [2022-07-21 02:05:57,766 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/forester-heap/sll-buckets-1.i[23275,23288] [2022-07-21 02:05:57,766 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/forester-heap/sll-buckets-1.i[23364,23377] [2022-07-21 02:05:57,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:05:57,796 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:05:57,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57 WrapperNode [2022-07-21 02:05:57,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:05:57,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:05:57,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:05:57,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:05:57,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,871 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2022-07-21 02:05:57,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:05:57,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:05:57,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:05:57,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:05:57,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:05:57,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:05:57,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:05:57,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:05:57,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (1/1) ... [2022-07-21 02:05:57,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:05:57,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:05:57,955 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-21 02:05:57,981 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-21 02:05:57,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:05:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:05:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:05:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:05:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:05:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:05:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:05:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:05:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:05:57,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:05:58,087 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:05:58,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:05:58,344 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:05:58,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:05:58,350 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-07-21 02:05:58,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:05:58 BoogieIcfgContainer [2022-07-21 02:05:58,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:05:58,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:05:58,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:05:58,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:05:58,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:05:57" (1/3) ... [2022-07-21 02:05:58,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306c7811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:05:58, skipping insertion in model container [2022-07-21 02:05:58,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:05:57" (2/3) ... [2022-07-21 02:05:58,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306c7811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:05:58, skipping insertion in model container [2022-07-21 02:05:58,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:05:58" (3/3) ... [2022-07-21 02:05:58,357 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2022-07-21 02:05:58,366 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:05:58,368 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-07-21 02:05:58,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:05:58,429 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@417ff714, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@475b18d0 [2022-07-21 02:05:58,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-21 02:05:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 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-21 02:05:58,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 02:05:58,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:05:58,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:05:58,439 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:05:58,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:05:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2022-07-21 02:05:58,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:05:58,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280359539] [2022-07-21 02:05:58,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:05:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:05:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:05:58,703 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-21 02:05:58,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:05:58,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280359539] [2022-07-21 02:05:58,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280359539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:05:58,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:05:58,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:05:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331973259] [2022-07-21 02:05:58,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:05:58,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:05:58,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:05:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:05:58,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:05:58,736 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-21 02:05:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:05:58,822 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2022-07-21 02:05:58,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:05:58,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-21 02:05:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:05:58,836 INFO L225 Difference]: With dead ends: 112 [2022-07-21 02:05:58,837 INFO L226 Difference]: Without dead ends: 66 [2022-07-21 02:05:58,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:05:58,842 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:05:58,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 84 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:05:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-21 02:05:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2022-07-21 02:05:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 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-21 02:05:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-07-21 02:05:58,869 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2022-07-21 02:05:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:05:58,870 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-07-21 02:05:58,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-21 02:05:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-07-21 02:05:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 02:05:58,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:05:58,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:05:58,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:05:58,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:05:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:05:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2022-07-21 02:05:58,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:05:58,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410936306] [2022-07-21 02:05:58,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:05:58,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:05:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:05:58,974 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-21 02:05:58,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:05:58,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410936306] [2022-07-21 02:05:58,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410936306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:05:58,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:05:58,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:05:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014873885] [2022-07-21 02:05:58,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:05:58,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:05:58,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:05:58,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:05:58,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:05:58,981 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-21 02:05:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:05:59,009 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-07-21 02:05:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:05:59,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-21 02:05:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:05:59,011 INFO L225 Difference]: With dead ends: 45 [2022-07-21 02:05:59,012 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 02:05:59,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:05:59,015 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:05:59,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:05:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 02:05:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-21 02:05:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 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-21 02:05:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-21 02:05:59,026 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2022-07-21 02:05:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:05:59,027 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-21 02:05:59,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-21 02:05:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-21 02:05:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 02:05:59,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:05:59,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:05:59,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:05:59,032 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:05:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:05:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2022-07-21 02:05:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:05:59,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955566978] [2022-07-21 02:05:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:05:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:05:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:05:59,200 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-21 02:05:59,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:05:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955566978] [2022-07-21 02:05:59,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955566978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:05:59,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:05:59,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 02:05:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106843741] [2022-07-21 02:05:59,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:05:59,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 02:05:59,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:05:59,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 02:05:59,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:05:59,206 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-21 02:05:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:05:59,328 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-07-21 02:05:59,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 02:05:59,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-21 02:05:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:05:59,336 INFO L225 Difference]: With dead ends: 61 [2022-07-21 02:05:59,337 INFO L226 Difference]: Without dead ends: 50 [2022-07-21 02:05:59,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:05:59,339 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:05:59,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:05:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-21 02:05:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-07-21 02:05:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 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-21 02:05:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-07-21 02:05:59,352 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2022-07-21 02:05:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:05:59,352 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-07-21 02:05:59,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-21 02:05:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-07-21 02:05:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 02:05:59,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:05:59,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:05:59,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:05:59,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:05:59,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:05:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2022-07-21 02:05:59,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:05:59,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33376388] [2022-07-21 02:05:59,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:05:59,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:05:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:05:59,412 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-21 02:05:59,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:05:59,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33376388] [2022-07-21 02:05:59,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33376388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:05:59,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:05:59,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:05:59,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246096001] [2022-07-21 02:05:59,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:05:59,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:05:59,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:05:59,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:05:59,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:05:59,415 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-21 02:05:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:05:59,478 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-07-21 02:05:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:05:59,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-21 02:05:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:05:59,479 INFO L225 Difference]: With dead ends: 45 [2022-07-21 02:05:59,479 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 02:05:59,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:05:59,484 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:05:59,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:05:59,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 02:05:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-07-21 02:05:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 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-21 02:05:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-07-21 02:05:59,490 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2022-07-21 02:05:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:05:59,490 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-07-21 02:05:59,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-21 02:05:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-07-21 02:05:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 02:05:59,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:05:59,491 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:05:59,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 02:05:59,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:05:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:05:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2022-07-21 02:05:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:05:59,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642690408] [2022-07-21 02:05:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:05:59,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:05:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:05:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:05:59,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:05:59,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642690408] [2022-07-21 02:05:59,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642690408] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:05:59,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265012619] [2022-07-21 02:05:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:05:59,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:05:59,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:05:59,659 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-21 02:05:59,660 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-21 02:05:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:05:59,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-21 02:05:59,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:05:59,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:05:59,876 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-21 02:05:59,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:05:59,884 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-07-21 02:05:59,905 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-21 02:05:59,906 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 74 [2022-07-21 02:05:59,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:05:59,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:05:59,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:05:59,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-21 02:05:59,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:05:59,948 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 02:05:59,948 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 35 treesize of output 27 [2022-07-21 02:05:59,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:06:00,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:00,082 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 0 case distinctions, treesize of input 43 treesize of output 48 [2022-07-21 02:06:00,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:00,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:06:00,094 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 02:06:00,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 51 [2022-07-21 02:06:00,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:00,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:06:00,217 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:06:00,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 44 [2022-07-21 02:06:00,229 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-21 02:06:00,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 21 [2022-07-21 02:06:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:00,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:06:00,465 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:06:00,465 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 1 [2022-07-21 02:06:00,473 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:06:00,473 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 1 [2022-07-21 02:06:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:00,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265012619] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:06:00,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:06:00,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-21 02:06:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59724656] [2022-07-21 02:06:00,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:06:00,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 02:06:00,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:06:00,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 02:06:00,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-07-21 02:06:00,477 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 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-21 02:06:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:06:00,833 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-07-21 02:06:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 02:06:00,833 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 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) Word has length 15 [2022-07-21 02:06:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:06:00,834 INFO L225 Difference]: With dead ends: 64 [2022-07-21 02:06:00,834 INFO L226 Difference]: Without dead ends: 53 [2022-07-21 02:06:00,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2022-07-21 02:06:00,834 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:06:00,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 219 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 187 Invalid, 0 Unknown, 28 Unchecked, 0.2s Time] [2022-07-21 02:06:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-21 02:06:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-07-21 02:06:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 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-21 02:06:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-07-21 02:06:00,838 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2022-07-21 02:06:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:06:00,838 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-07-21 02:06:00,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 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-21 02:06:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-07-21 02:06:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 02:06:00,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:06:00,839 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:06:00,860 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-21 02:06:01,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:01,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:06:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:06:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2022-07-21 02:06:01,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:06:01,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425800483] [2022-07-21 02:06:01,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:06:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:01,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:06:01,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425800483] [2022-07-21 02:06:01,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425800483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:06:01,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32697752] [2022-07-21 02:06:01,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:01,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:01,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:06:01,121 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-21 02:06:01,177 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-21 02:06:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:01,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-21 02:06:01,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:06:01,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:01,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-21 02:06:01,299 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-21 02:06:01,299 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 71 [2022-07-21 02:06:01,322 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-21 02:06:01,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-21 02:06:01,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:01,363 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 41 treesize of output 37 [2022-07-21 02:06:01,373 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-21 02:06:01,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 02:06:01,400 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 40 treesize of output 36 [2022-07-21 02:06:01,472 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:06:01,472 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-07-21 02:06:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:01,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:06:01,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_671) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2022-07-21 02:06:01,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_22| Int) (v_ArrVal_671 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_22| v_ArrVal_671) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_22|) 0)))) is different from false [2022-07-21 02:06:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:01,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32697752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:06:01,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:06:01,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-07-21 02:06:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37661449] [2022-07-21 02:06:01,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:06:01,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 02:06:01,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:06:01,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 02:06:01,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2022-07-21 02:06:01,540 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:06:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:06:02,000 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2022-07-21 02:06:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 02:06:02,000 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 02:06:02,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:06:02,001 INFO L225 Difference]: With dead ends: 155 [2022-07-21 02:06:02,001 INFO L226 Difference]: Without dead ends: 153 [2022-07-21 02:06:02,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=262, Unknown=2, NotChecked=74, Total=462 [2022-07-21 02:06:02,002 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 283 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:06:02,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 326 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 264 Invalid, 0 Unknown, 167 Unchecked, 0.3s Time] [2022-07-21 02:06:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-21 02:06:02,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 71. [2022-07-21 02:06:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 0 states have call successors, (0), 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-21 02:06:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2022-07-21 02:06:02,008 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 16 [2022-07-21 02:06:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:06:02,008 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2022-07-21 02:06:02,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:06:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-07-21 02:06:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 02:06:02,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:06:02,009 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:06:02,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 02:06:02,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-21 02:06:02,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:06:02,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:06:02,210 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2022-07-21 02:06:02,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:06:02,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895767942] [2022-07-21 02:06:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:02,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:06:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:02,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:06:02,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895767942] [2022-07-21 02:06:02,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895767942] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:06:02,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699342380] [2022-07-21 02:06:02,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:06:02,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:02,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:06:02,321 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-21 02:06:02,322 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-21 02:06:02,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:06:02,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:06:02,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-21 02:06:02,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:06:02,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:02,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:02,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:02,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-07-21 02:06:02,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:02,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:02,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:02,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 02:06:02,599 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:06:02,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 35 treesize of output 34 [2022-07-21 02:06:02,666 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-21 02:06:02,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-21 02:06:02,671 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 16 treesize of output 18 [2022-07-21 02:06:02,692 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-21 02:06:02,755 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 33 treesize of output 13 [2022-07-21 02:06:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:06:02,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:06:02,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699342380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:06:02,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 02:06:02,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-21 02:06:02,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505838175] [2022-07-21 02:06:02,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:06:02,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 02:06:02,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:06:02,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 02:06:02,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-21 02:06:02,780 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:06:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:06:03,001 INFO L93 Difference]: Finished difference Result 138 states and 171 transitions. [2022-07-21 02:06:03,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 02:06:03,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 02:06:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:06:03,003 INFO L225 Difference]: With dead ends: 138 [2022-07-21 02:06:03,003 INFO L226 Difference]: Without dead ends: 103 [2022-07-21 02:06:03,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-21 02:06:03,004 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:06:03,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 142 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2022-07-21 02:06:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-21 02:06:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2022-07-21 02:06:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 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-21 02:06:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-07-21 02:06:03,010 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 18 [2022-07-21 02:06:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:06:03,010 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-07-21 02:06:03,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:06:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-07-21 02:06:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 02:06:03,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:06:03,011 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:06:03,035 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-21 02:06:03,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:03,224 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:06:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:06:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2022-07-21 02:06:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:06:03,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057452276] [2022-07-21 02:06:03,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:03,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:06:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:03,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:06:03,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057452276] [2022-07-21 02:06:03,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057452276] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:06:03,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301736029] [2022-07-21 02:06:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:03,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:03,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:06:03,335 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-21 02:06:03,336 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-21 02:06:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:03,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-21 02:06:03,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:06:03,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,481 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-21 02:06:03,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,504 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-21 02:06:03,521 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-21 02:06:03,522 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 81 [2022-07-21 02:06:03,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-21 02:06:03,553 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-21 02:06:03,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-21 02:06:03,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:06:03,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:06:03,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,628 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:06:03,629 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 78 [2022-07-21 02:06:03,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-07-21 02:06:03,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,648 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-21 02:06:03,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-07-21 02:06:03,715 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:06:03,716 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 76 [2022-07-21 02:06:03,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-07-21 02:06:03,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:03,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 37 treesize of output 13 [2022-07-21 02:06:03,885 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:06:03,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 26 [2022-07-21 02:06:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:03,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:06:03,929 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1043))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) is different from false [2022-07-21 02:06:03,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_24| Int) (v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_24|) 0)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_24| v_ArrVal_1043))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_24| v_ArrVal_1042) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0)))) is different from false [2022-07-21 02:06:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:03,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301736029] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:06:03,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:06:03,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-21 02:06:03,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052785482] [2022-07-21 02:06:03,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:06:03,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 02:06:03,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:06:03,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 02:06:03,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=195, Unknown=2, NotChecked=58, Total=306 [2022-07-21 02:06:03,980 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 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-21 02:06:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:06:04,595 INFO L93 Difference]: Finished difference Result 127 states and 156 transitions. [2022-07-21 02:06:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 02:06:04,595 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 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) Word has length 19 [2022-07-21 02:06:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:06:04,596 INFO L225 Difference]: With dead ends: 127 [2022-07-21 02:06:04,596 INFO L226 Difference]: Without dead ends: 125 [2022-07-21 02:06:04,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=454, Unknown=2, NotChecked=94, Total=702 [2022-07-21 02:06:04,596 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 210 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:06:04,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 255 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 306 Invalid, 0 Unknown, 165 Unchecked, 0.3s Time] [2022-07-21 02:06:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-21 02:06:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 80. [2022-07-21 02:06:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:06:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2022-07-21 02:06:04,602 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 19 [2022-07-21 02:06:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:06:04,603 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2022-07-21 02:06:04,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 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-21 02:06:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-07-21 02:06:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 02:06:04,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:06:04,603 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:06:04,631 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-21 02:06:04,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:04,817 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:06:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:06:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2022-07-21 02:06:04,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:06:04,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143199378] [2022-07-21 02:06:04,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:04,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:06:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:05,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:06:05,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143199378] [2022-07-21 02:06:05,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143199378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:06:05,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678691125] [2022-07-21 02:06:05,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:06:05,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:05,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:06:05,012 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-21 02:06:05,014 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-21 02:06:05,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:06:05,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:06:05,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-21 02:06:05,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:06:05,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:05,455 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-07-21 02:06:05,477 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-21 02:06:05,477 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 92 [2022-07-21 02:06:05,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:05,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-07-21 02:06:05,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:05,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:05,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:05,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-07-21 02:06:05,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:06:05,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 31 [2022-07-21 02:06:05,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 31 [2022-07-21 02:06:05,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:06:05,519 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-21 02:06:05,519 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 59 treesize of output 43 [2022-07-21 02:06:05,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:05,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:06:05,649 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 02:06:05,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 69 [2022-07-21 02:06:05,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:05,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:05,655 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 0 case distinctions, treesize of input 67 treesize of output 69 [2022-07-21 02:06:05,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:05,785 INFO L356 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2022-07-21 02:06:05,786 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 2 case distinctions, treesize of input 65 treesize of output 58 [2022-07-21 02:06:05,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:05,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:06:05,799 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 02:06:05,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 65 [2022-07-21 02:06:05,947 INFO L356 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-07-21 02:06:05,947 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 64 [2022-07-21 02:06:05,955 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:06:05,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2022-07-21 02:06:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:05,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:06:13,345 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:06:13,345 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 1 [2022-07-21 02:06:13,352 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:06:13,352 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 1 [2022-07-21 02:06:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:13,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678691125] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:06:13,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:06:13,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-07-21 02:06:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016887658] [2022-07-21 02:06:13,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:06:13,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 02:06:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:06:13,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 02:06:13,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=279, Unknown=1, NotChecked=0, Total=342 [2022-07-21 02:06:13,358 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 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-21 02:06:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:06:13,641 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-07-21 02:06:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 02:06:13,642 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 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 20 [2022-07-21 02:06:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:06:13,642 INFO L225 Difference]: With dead ends: 97 [2022-07-21 02:06:13,643 INFO L226 Difference]: Without dead ends: 86 [2022-07-21 02:06:13,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=117, Invalid=434, Unknown=1, NotChecked=0, Total=552 [2022-07-21 02:06:13,643 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:06:13,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 251 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 135 Unchecked, 0.1s Time] [2022-07-21 02:06:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-21 02:06:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-07-21 02:06:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 84 states have internal predecessors, (103), 0 states have call successors, (0), 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-21 02:06:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-07-21 02:06:13,659 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 20 [2022-07-21 02:06:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:06:13,659 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-07-21 02:06:13,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 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-21 02:06:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-07-21 02:06:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 02:06:13,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:06:13,660 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:06:13,679 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-21 02:06:13,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:13,870 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:06:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:06:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash 220535656, now seen corresponding path program 2 times [2022-07-21 02:06:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:06:13,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734434120] [2022-07-21 02:06:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:06:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:06:14,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:06:14,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734434120] [2022-07-21 02:06:14,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734434120] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:06:14,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178432775] [2022-07-21 02:06:14,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:06:14,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:14,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:06:14,012 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-21 02:06:14,012 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-21 02:06:14,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:06:14,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:06:14,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-21 02:06:14,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:06:14,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:14,411 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-21 02:06:14,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:14,418 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-21 02:06:14,438 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-21 02:06:14,439 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 99 [2022-07-21 02:06:14,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2022-07-21 02:06:14,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:14,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:14,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:14,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-21 02:06:14,479 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-21 02:06:14,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-21 02:06:14,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:06:14,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-21 02:06:14,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:14,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:14,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-07-21 02:06:14,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:14,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-07-21 02:06:14,595 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-21 02:06:14,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2022-07-21 02:06:14,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-21 02:06:14,651 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 56 treesize of output 50 [2022-07-21 02:06:14,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-21 02:06:14,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-07-21 02:06:14,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 37 treesize of output 13 [2022-07-21 02:06:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-07-21 02:06:14,840 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 33 treesize of output 13 [2022-07-21 02:06:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:06:14,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:06:14,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 1)) is different from false [2022-07-21 02:06:14,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:06:14,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 35 [2022-07-21 02:06:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:06:14,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178432775] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:06:14,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:06:14,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-21 02:06:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836277323] [2022-07-21 02:06:14,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:06:14,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 02:06:14,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:06:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 02:06:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=228, Unknown=1, NotChecked=30, Total=306 [2022-07-21 02:06:14,967 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 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-21 02:06:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:06:15,603 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2022-07-21 02:06:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 02:06:15,604 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 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 21 [2022-07-21 02:06:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:06:15,604 INFO L225 Difference]: With dead ends: 165 [2022-07-21 02:06:15,605 INFO L226 Difference]: Without dead ends: 130 [2022-07-21 02:06:15,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=406, Unknown=1, NotChecked=42, Total=552 [2022-07-21 02:06:15,606 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 100 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 02:06:15,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 309 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 331 Invalid, 0 Unknown, 77 Unchecked, 0.5s Time] [2022-07-21 02:06:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-21 02:06:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2022-07-21 02:06:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 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-21 02:06:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-07-21 02:06:15,613 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 21 [2022-07-21 02:06:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:06:15,613 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-07-21 02:06:15,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 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-21 02:06:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-07-21 02:06:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 02:06:15,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:06:15,614 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:06:15,633 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-21 02:06:15,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:15,824 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:06:15,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:06:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2022-07-21 02:06:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:06:15,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238535236] [2022-07-21 02:06:15,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:06:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:16,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:06:16,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238535236] [2022-07-21 02:06:16,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238535236] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:06:16,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119721934] [2022-07-21 02:06:16,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:16,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:16,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:06:16,003 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-21 02:06:16,009 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-21 02:06:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:16,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-21 02:06:16,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:06:16,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,176 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-21 02:06:16,194 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-21 02:06:16,194 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 94 [2022-07-21 02:06:16,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-07-21 02:06:16,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-07-21 02:06:16,233 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-21 02:06:16,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-21 02:06:16,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:06:16,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2022-07-21 02:06:16,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:06:16,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-21 02:06:16,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,330 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:06:16,331 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 76 [2022-07-21 02:06:16,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,348 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-21 02:06:16,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-07-21 02:06:16,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:06:16,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:16,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-21 02:06:16,436 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:06:16,436 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 74 [2022-07-21 02:06:16,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-21 02:06:16,746 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 02:06:16,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 62 [2022-07-21 02:06:16,757 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-21 02:06:16,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 22 [2022-07-21 02:06:16,781 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 33 treesize of output 13 [2022-07-21 02:06:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:16,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:06:16,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1655)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1654))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 2)) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2))))) 2)) is different from false [2022-07-21 02:06:16,926 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:06:16,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 59 treesize of output 63 [2022-07-21 02:06:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:16,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119721934] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:06:16,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:06:16,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-07-21 02:06:16,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348492633] [2022-07-21 02:06:16,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:06:16,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 02:06:16,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:06:16,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 02:06:16,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2022-07-21 02:06:16,997 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-21 02:06:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:06:17,875 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2022-07-21 02:06:17,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 02:06:17,875 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-21 02:06:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:06:17,876 INFO L225 Difference]: With dead ends: 162 [2022-07-21 02:06:17,876 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 02:06:17,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=683, Unknown=1, NotChecked=54, Total=870 [2022-07-21 02:06:17,877 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 125 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 02:06:17,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 375 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 492 Invalid, 0 Unknown, 159 Unchecked, 0.6s Time] [2022-07-21 02:06:17,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 02:06:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2022-07-21 02:06:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 95 states have internal predecessors, (116), 0 states have call successors, (0), 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-21 02:06:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-07-21 02:06:17,889 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 21 [2022-07-21 02:06:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:06:17,889 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-07-21 02:06:17,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 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-21 02:06:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-07-21 02:06:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 02:06:17,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:06:17,892 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:06:17,912 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-21 02:06:18,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:18,099 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:06:18,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:06:18,100 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2022-07-21 02:06:18,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:06:18,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046396828] [2022-07-21 02:06:18,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:18,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:06:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:18,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:06:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046396828] [2022-07-21 02:06:18,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046396828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:06:18,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126075354] [2022-07-21 02:06:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:18,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:18,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:06:18,316 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-21 02:06:18,342 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-21 02:06:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:18,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-21 02:06:18,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:06:18,504 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-21 02:06:18,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 22 treesize of output 23 [2022-07-21 02:06:18,547 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 02:06:18,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:06:18,569 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 13 treesize of output 9 [2022-07-21 02:06:18,715 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 13 treesize of output 9 [2022-07-21 02:06:18,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:18,720 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 27 treesize of output 29 [2022-07-21 02:06:18,723 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 13 treesize of output 9 [2022-07-21 02:06:18,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 02:06:18,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:18,788 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 33 treesize of output 35 [2022-07-21 02:06:18,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-21 02:06:18,844 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-21 02:06:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:18,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:06:18,930 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 174 treesize of output 168 [2022-07-21 02:06:18,932 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 310 treesize of output 298 [2022-07-21 02:06:30,251 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 133 treesize of output 115 [2022-07-21 02:06:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:30,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126075354] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:06:30,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:06:30,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 29 [2022-07-21 02:06:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207497960] [2022-07-21 02:06:30,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:06:30,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 02:06:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:06:30,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 02:06:30,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=697, Unknown=7, NotChecked=0, Total=812 [2022-07-21 02:06:30,326 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 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-21 02:06:30,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:06:30,658 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2022-07-21 02:06:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 02:06:30,659 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 02:06:30,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:06:30,659 INFO L225 Difference]: With dead ends: 120 [2022-07-21 02:06:30,659 INFO L226 Difference]: Without dead ends: 118 [2022-07-21 02:06:30,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=156, Invalid=1027, Unknown=7, NotChecked=0, Total=1190 [2022-07-21 02:06:30,660 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 117 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:06:30,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 308 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 213 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2022-07-21 02:06:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-21 02:06:30,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2022-07-21 02:06:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 106 states have internal predecessors, (130), 0 states have call successors, (0), 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-21 02:06:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2022-07-21 02:06:30,666 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 24 [2022-07-21 02:06:30,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:06:30,666 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2022-07-21 02:06:30,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 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-21 02:06:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2022-07-21 02:06:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:06:30,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:06:30,667 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:06:30,689 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-21 02:06:30,890 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,SelfDestructingSolverStorable11 [2022-07-21 02:06:30,890 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:06:30,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:06:30,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1317906679, now seen corresponding path program 3 times [2022-07-21 02:06:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:06:30,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400413599] [2022-07-21 02:06:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:06:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:06:31,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400413599] [2022-07-21 02:06:31,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400413599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:06:31,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145741318] [2022-07-21 02:06:31,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 02:06:31,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:31,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:06:31,044 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-21 02:06:31,045 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-21 02:06:32,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 02:06:32,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:06:32,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-21 02:06:32,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:06:32,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,416 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-07-21 02:06:32,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,421 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-07-21 02:06:32,439 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-21 02:06:32,439 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 79 [2022-07-21 02:06:32,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-07-21 02:06:32,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:06:32,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 31 [2022-07-21 02:06:32,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:06:32,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 31 [2022-07-21 02:06:32,473 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-21 02:06:32,473 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 59 treesize of output 43 [2022-07-21 02:06:32,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,557 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-21 02:06:32,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,563 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:06:32,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 62 [2022-07-21 02:06:32,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,648 INFO L356 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-07-21 02:06:32,649 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 54 treesize of output 55 [2022-07-21 02:06:32,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,655 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:06:32,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 65 [2022-07-21 02:06:32,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:32,782 INFO L356 Elim1Store]: treesize reduction 168, result has 21.1 percent of original size [2022-07-21 02:06:32,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 80 [2022-07-21 02:06:32,803 INFO L356 Elim1Store]: treesize reduction 108, result has 16.9 percent of original size [2022-07-21 02:06:32,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 72 [2022-07-21 02:06:32,889 INFO L356 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2022-07-21 02:06:32,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 74 [2022-07-21 02:06:32,900 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-21 02:06:32,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-21 02:06:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:32,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:06:38,712 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:06:38,712 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 520 treesize of output 1 [2022-07-21 02:06:38,717 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:06:38,718 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 520 treesize of output 1 [2022-07-21 02:06:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:38,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145741318] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:06:38,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:06:38,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2022-07-21 02:06:38,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168304126] [2022-07-21 02:06:38,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:06:38,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 02:06:38,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:06:38,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 02:06:38,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=251, Unknown=1, NotChecked=0, Total=306 [2022-07-21 02:06:38,720 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 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-21 02:06:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:06:38,915 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2022-07-21 02:06:38,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 02:06:38,916 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 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 25 [2022-07-21 02:06:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:06:38,916 INFO L225 Difference]: With dead ends: 122 [2022-07-21 02:06:38,916 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 02:06:38,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2022-07-21 02:06:38,917 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:06:38,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 280 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 121 Unchecked, 0.2s Time] [2022-07-21 02:06:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 02:06:38,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 02:06:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 93 states have internal predecessors, (116), 0 states have call successors, (0), 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-21 02:06:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-07-21 02:06:38,922 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 25 [2022-07-21 02:06:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:06:38,922 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-07-21 02:06:38,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 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-21 02:06:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-07-21 02:06:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:06:38,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:06:38,923 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:06:38,946 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-21 02:06:39,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 02:06:39,134 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:06:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:06:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash 352741712, now seen corresponding path program 1 times [2022-07-21 02:06:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:06:39,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789032615] [2022-07-21 02:06:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:39,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:06:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:39,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:06:39,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789032615] [2022-07-21 02:06:39,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789032615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:06:39,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:06:39,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 02:06:39,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827330412] [2022-07-21 02:06:39,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:06:39,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 02:06:39,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:06:39,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 02:06:39,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:06:39,221 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-21 02:06:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:06:39,449 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2022-07-21 02:06:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:06:39,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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) Word has length 25 [2022-07-21 02:06:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:06:39,450 INFO L225 Difference]: With dead ends: 150 [2022-07-21 02:06:39,450 INFO L226 Difference]: Without dead ends: 98 [2022-07-21 02:06:39,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 02:06:39,451 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 49 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:06:39,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 173 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 02:06:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-21 02:06:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2022-07-21 02:06:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 87 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-21 02:06:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2022-07-21 02:06:39,455 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 25 [2022-07-21 02:06:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:06:39,455 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2022-07-21 02:06:39,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-21 02:06:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2022-07-21 02:06:39,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 02:06:39,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:06:39,457 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, 1, 1, 1, 1] [2022-07-21 02:06:39,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 02:06:39,457 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:06:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:06:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2022-07-21 02:06:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:06:39,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581012104] [2022-07-21 02:06:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:06:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:06:39,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:06:39,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581012104] [2022-07-21 02:06:39,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581012104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:06:39,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116863753] [2022-07-21 02:06:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:06:39,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:06:39,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:06:39,676 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-21 02:06:39,691 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-21 02:06:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:06:39,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-21 02:06:39,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:06:39,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:39,857 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-07-21 02:06:39,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:39,861 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-07-21 02:06:39,894 INFO L356 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2022-07-21 02:06:39,895 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 81 [2022-07-21 02:06:39,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:39,913 INFO L356 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2022-07-21 02:06:39,913 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 2 case distinctions, treesize of input 40 treesize of output 52 [2022-07-21 02:06:39,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 19 treesize of output 24 [2022-07-21 02:06:39,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-21 02:06:39,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 19 [2022-07-21 02:06:39,932 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 14 treesize of output 10 [2022-07-21 02:06:39,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 19 [2022-07-21 02:06:39,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:39,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 7 [2022-07-21 02:06:39,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 65 treesize of output 53 [2022-07-21 02:06:40,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:40,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 76 treesize of output 58 [2022-07-21 02:06:40,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:40,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 76 treesize of output 58 [2022-07-21 02:06:40,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:40,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:06:40,460 INFO L356 Elim1Store]: treesize reduction 140, result has 60.7 percent of original size [2022-07-21 02:06:40,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 221 treesize of output 387 [2022-07-21 02:06:40,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:06:40,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:06:40,587 INFO L356 Elim1Store]: treesize reduction 92, result has 58.2 percent of original size [2022-07-21 02:06:40,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 33 case distinctions, treesize of input 398 treesize of output 393 [2022-07-21 02:07:33,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:33,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:07:33,820 INFO L356 Elim1Store]: treesize reduction 158, result has 27.5 percent of original size [2022-07-21 02:07:33,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 561 treesize of output 499 [2022-07-21 02:07:33,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:33,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:07:33,903 INFO L356 Elim1Store]: treesize reduction 178, result has 25.2 percent of original size [2022-07-21 02:07:33,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 485 treesize of output 424 [2022-07-21 02:08:56,796 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-21 02:08:56,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 171 treesize of output 152 [2022-07-21 02:08:56,802 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 02:08:56,802 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 129 treesize of output 108 [2022-07-21 02:08:56,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 111 treesize of output 101 [2022-07-21 02:08:56,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 92 treesize of output 86 [2022-07-21 02:08:57,057 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 22 treesize of output 10 [2022-07-21 02:08:57,061 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:08:57,061 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-07-21 02:08:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:08:57,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:08:57,139 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2400) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2399 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2022-07-21 02:08:57,270 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2399 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2399) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2400) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2022-07-21 02:08:57,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2395 Int) (v_ArrVal_2397 Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 v_ArrVal_2395)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) (and (forall ((v_ArrVal_2399 (Array Int Int))) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse1 v_ArrVal_2395)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse1 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2399)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_2397)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2022-07-21 02:08:57,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2395 Int) (v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (and (forall ((v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2399) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) is different from false [2022-07-21 02:08:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 02:08:57,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116863753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:08:57,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:08:57,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2022-07-21 02:08:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322389502] [2022-07-21 02:08:57,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:08:57,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 02:08:57,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:08:57,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 02:08:57,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=393, Unknown=4, NotChecked=172, Total=650 [2022-07-21 02:08:57,567 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:08:59,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse16 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse0 (not (= .cse14 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (.cse2 (= (select .cse13 .cse16) 0)) (.cse3 (= (select .cse15 .cse16) 0)) (.cse1 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and .cse0 (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse1 4) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse2 (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) .cse3 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse1) 0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (and (forall ((v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2399) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (let ((.cse12 (select |c_#memory_$Pointer$.offset| .cse14)) (.cse10 (select |c_#memory_$Pointer$.base| .cse14))) (let ((.cse8 (select .cse10 0)) (.cse9 (= (select .cse13 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (.cse11 (= (select .cse12 0) 0))) (or (exists ((v_arrayElimCell_197 Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| v_arrayElimCell_197))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_197)) (.cse6 (select .cse7 0))) (and (= (select .cse5 0) 0) (= .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|) (= (select .cse5 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse6) 0) 0) (not (= v_arrayElimCell_197 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 0) 0) (= (select .cse7 4) 0))))) (and .cse0 (= 0 (select (select |c_#memory_$Pointer$.base| .cse8) 0)) .cse9 .cse2 (= (select .cse10 4) 0) .cse11 (= (select (select |c_#memory_$Pointer$.offset| .cse8) 0) 0) .cse3 (= (select .cse12 4) 0)) (and .cse0 (= .cse8 0) .cse9 .cse2 .cse11 .cse3)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse1) 0))))) is different from false [2022-07-21 02:09:01,702 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse0 (not (= .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (.cse1 (= (select .cse12 .cse15) 0)) (.cse2 (= (select .cse14 .cse15) 0))) (and .cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse1 (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) .cse2 (forall ((v_ArrVal_2395 Int) (v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (and (forall ((v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2399) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2400)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2395)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_47|) 0 0) 4 v_ArrVal_2397)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) (let ((.cse11 (select |c_#memory_$Pointer$.offset| .cse13)) (.cse9 (select |c_#memory_$Pointer$.base| .cse13))) (let ((.cse7 (select .cse9 0)) (.cse8 (= (select .cse12 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (.cse10 (= (select .cse11 0) 0))) (or (exists ((v_arrayElimCell_197 Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| v_arrayElimCell_197))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_197)) (.cse5 (select .cse6 0))) (and (= (select .cse4 0) 0) (= .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|) (= (select .cse4 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse5) 0) 0) (not (= v_arrayElimCell_197 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 0) 0) (= (select .cse6 4) 0))))) (and .cse0 (= 0 (select (select |c_#memory_$Pointer$.base| .cse7) 0)) .cse8 .cse1 (= (select .cse9 4) 0) .cse10 (= (select (select |c_#memory_$Pointer$.offset| .cse7) 0) 0) .cse2 (= (select .cse11 4) 0)) (and .cse0 (= .cse7 0) .cse8 .cse1 .cse10 .cse2)))))))) is different from false [2022-07-21 02:09:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:09:04,494 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2022-07-21 02:09:04,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 02:09:04,495 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 02:09:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:09:04,496 INFO L225 Difference]: With dead ends: 115 [2022-07-21 02:09:04,496 INFO L226 Difference]: Without dead ends: 104 [2022-07-21 02:09:04,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=183, Invalid=825, Unknown=8, NotChecked=390, Total=1406 [2022-07-21 02:09:04,498 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 73 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:09:04,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 264 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 335 Unchecked, 0.2s Time] [2022-07-21 02:09:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-21 02:09:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2022-07-21 02:09:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 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-21 02:09:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2022-07-21 02:09:04,508 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 27 [2022-07-21 02:09:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:09:04,508 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2022-07-21 02:09:04,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:09:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2022-07-21 02:09:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 02:09:04,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:09:04,509 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, 1, 1, 1, 1] [2022-07-21 02:09:04,527 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-21 02:09:04,719 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,SelfDestructingSolverStorable14 [2022-07-21 02:09:04,720 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:09:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:09:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1921519731, now seen corresponding path program 1 times [2022-07-21 02:09:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:09:04,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952358631] [2022-07-21 02:09:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:09:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:09:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:09:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:09:05,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:09:05,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952358631] [2022-07-21 02:09:05,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952358631] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:09:05,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737249943] [2022-07-21 02:09:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:09:05,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:09:05,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:09:05,005 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-21 02:09:05,006 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-21 02:09:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:09:05,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-21 02:09:05,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:09:05,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:05,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-21 02:09:05,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:05,195 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-21 02:09:05,209 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-21 02:09:05,210 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 62 [2022-07-21 02:09:05,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:05,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:05,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:05,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-21 02:09:05,218 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 02:09:05,219 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 35 treesize of output 27 [2022-07-21 02:09:05,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:05,251 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:09:05,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 02:09:05,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:05,264 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 02:09:05,264 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 29 treesize of output 35 [2022-07-21 02:09:05,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:05,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:09:05,319 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-21 02:09:05,319 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 3 case distinctions, treesize of input 40 treesize of output 49 [2022-07-21 02:09:05,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:05,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:09:05,330 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-21 02:09:05,330 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 3 case distinctions, treesize of input 35 treesize of output 44 [2022-07-21 02:09:06,031 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-21 02:09:06,031 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 57 [2022-07-21 02:09:06,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:06,043 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:09:06,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 45 [2022-07-21 02:09:06,132 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 22 treesize of output 10 [2022-07-21 02:09:06,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:09:06,135 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-07-21 02:09:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:09:06,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:09:06,234 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)))) (forall ((v_ArrVal_2612 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2612) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2022-07-21 02:09:06,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2610 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2612 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2612)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2022-07-21 02:09:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 02:09:06,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737249943] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:09:06,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:09:06,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2022-07-21 02:09:06,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740920004] [2022-07-21 02:09:06,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:09:06,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 02:09:06,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:09:06,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 02:09:06,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=507, Unknown=4, NotChecked=94, Total=702 [2022-07-21 02:09:06,678 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:09:06,787 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse0 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2610 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2612 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2612)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= (select .cse1 .cse3) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse4 .cse3) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse5) 0)))) is different from false [2022-07-21 02:09:06,879 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse0 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2610 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2609)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2612 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2610)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2612)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (= (select .cse1 .cse3) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select .cse4 .cse3) 0) (not (= .cse0 0))))) is different from false [2022-07-21 02:09:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:09:07,376 INFO L93 Difference]: Finished difference Result 150 states and 181 transitions. [2022-07-21 02:09:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 02:09:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 02:09:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:09:07,378 INFO L225 Difference]: With dead ends: 150 [2022-07-21 02:09:07,378 INFO L226 Difference]: Without dead ends: 139 [2022-07-21 02:09:07,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=200, Invalid=932, Unknown=6, NotChecked=268, Total=1406 [2022-07-21 02:09:07,379 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 96 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:09:07,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 415 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 163 Invalid, 0 Unknown, 310 Unchecked, 0.1s Time] [2022-07-21 02:09:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-21 02:09:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 117. [2022-07-21 02:09:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.2521739130434784) internal successors, (144), 116 states have internal predecessors, (144), 0 states have call successors, (0), 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-21 02:09:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2022-07-21 02:09:07,385 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 27 [2022-07-21 02:09:07,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:09:07,386 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2022-07-21 02:09:07,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:09:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2022-07-21 02:09:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 02:09:07,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:09:07,387 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:09:07,407 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-21 02:09:07,611 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,SelfDestructingSolverStorable15 [2022-07-21 02:09:07,611 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:09:07,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:09:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1308386699, now seen corresponding path program 1 times [2022-07-21 02:09:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:09:07,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782299397] [2022-07-21 02:09:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:09:07,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:09:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:09:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:09:07,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:09:07,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782299397] [2022-07-21 02:09:07,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782299397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:09:07,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:09:07,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:09:07,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159172492] [2022-07-21 02:09:07,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:09:07,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:09:07,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:09:07,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:09:07,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:09:07,695 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:09:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:09:07,805 INFO L93 Difference]: Finished difference Result 162 states and 200 transitions. [2022-07-21 02:09:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:09:07,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 02:09:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:09:07,809 INFO L225 Difference]: With dead ends: 162 [2022-07-21 02:09:07,809 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 02:09:07,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 02:09:07,810 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:09:07,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 105 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:09:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 02:09:07,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2022-07-21 02:09:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 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-21 02:09:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2022-07-21 02:09:07,816 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 27 [2022-07-21 02:09:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:09:07,816 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2022-07-21 02:09:07,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:09:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2022-07-21 02:09:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 02:09:07,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:09:07,817 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:09:07,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 02:09:07,817 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:09:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:09:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1764820376, now seen corresponding path program 2 times [2022-07-21 02:09:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:09:07,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087288788] [2022-07-21 02:09:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:09:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:09:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:09:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:09:07,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:09:07,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087288788] [2022-07-21 02:09:07,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087288788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:09:07,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253555179] [2022-07-21 02:09:07,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:09:07,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:09:07,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:09:07,994 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-21 02:09:07,994 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-21 02:09:08,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:09:08,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:09:08,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-21 02:09:08,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:09:08,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:08,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:08,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:08,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-07-21 02:09:08,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:08,354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-21 02:09:08,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:08,359 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-07-21 02:09:08,380 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:09:08,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 35 treesize of output 34 [2022-07-21 02:09:08,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2022-07-21 02:09:08,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 02:09:08,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 02:09:08,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2022-07-21 02:09:08,443 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:09:08,443 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 16 treesize of output 22 [2022-07-21 02:09:08,446 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 7 treesize of output 3 [2022-07-21 02:09:08,460 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:09:08,460 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 16 treesize of output 22 [2022-07-21 02:09:08,464 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 7 treesize of output 3 [2022-07-21 02:09:08,483 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-21 02:09:08,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-07-21 02:09:08,516 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 7 treesize of output 3 [2022-07-21 02:09:08,525 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:09:08,525 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 11 treesize of output 11 [2022-07-21 02:09:08,570 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-21 02:09:08,574 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 16 treesize of output 18 [2022-07-21 02:09:08,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:09:08,709 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:09:08,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2022-07-21 02:09:08,824 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-21 02:09:08,824 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 23 treesize of output 22 [2022-07-21 02:09:08,835 INFO L356 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2022-07-21 02:09:08,835 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 32 treesize of output 25 [2022-07-21 02:09:08,955 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-21 02:09:08,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2022-07-21 02:09:08,957 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-21 02:09:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 02:09:08,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:09:09,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_2930 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.base| Int) (v_ArrVal_2929 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2930))) (let ((.cse2 (select .cse1 |ULTIMATE.start_main_~bcki~0#1.base|)) (.cse3 (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (and (forall ((v_ArrVal_2933 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2929))) (store .cse0 |ULTIMATE.start_main_~bcki~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~bcki~0#1.base|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_2933))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (= (select (select (store .cse1 |ULTIMATE.start_main_~bcki~0#1.base| (store .cse2 .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (not (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) 2)) |ULTIMATE.start_main_~bcki~0#1.base|) (+ 8 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (not (= (select .cse2 .cse3) 0)))))) is different from false [2022-07-21 02:09:09,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:09:09,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2022-07-21 02:09:09,877 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:09:09,877 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2022-07-21 02:09:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 02:09:09,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253555179] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:09:09,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:09:09,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-07-21 02:09:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765443955] [2022-07-21 02:09:09,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:09:09,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-21 02:09:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:09:09,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-21 02:09:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=475, Unknown=1, NotChecked=44, Total=600 [2022-07-21 02:09:09,879 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 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-21 02:09:10,033 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse7 (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select .cse0 .cse1) 0) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_2930 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.base| Int) (v_ArrVal_2929 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2930))) (let ((.cse4 (select .cse3 |ULTIMATE.start_main_~bcki~0#1.base|)) (.cse5 (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (and (forall ((v_ArrVal_2933 Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2929))) (store .cse2 |ULTIMATE.start_main_~bcki~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~bcki~0#1.base|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_2933))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (= (select (select (store .cse3 |ULTIMATE.start_main_~bcki~0#1.base| (store .cse4 .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (not (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) 2)) |ULTIMATE.start_main_~bcki~0#1.base|) (+ 8 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (not (= (select .cse4 .cse5) 0)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse6 .cse1) 0) (not (= .cse7 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= (select (select |c_#memory_$Pointer$.base| .cse7) 0) |c_ULTIMATE.start_main_~bucket~0#1.base|))))) is different from false [2022-07-21 02:09:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:09:46,763 INFO L93 Difference]: Finished difference Result 149 states and 182 transitions. [2022-07-21 02:09:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 02:09:46,763 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-21 02:09:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:09:46,764 INFO L225 Difference]: With dead ends: 149 [2022-07-21 02:09:46,764 INFO L226 Difference]: Without dead ends: 138 [2022-07-21 02:09:46,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=273, Invalid=1134, Unknown=7, NotChecked=146, Total=1560 [2022-07-21 02:09:46,765 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 97 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:09:46,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 315 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 214 Invalid, 0 Unknown, 186 Unchecked, 0.2s Time] [2022-07-21 02:09:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-21 02:09:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 115. [2022-07-21 02:09:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 113 states have (on average 1.247787610619469) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 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-21 02:09:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2022-07-21 02:09:46,772 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 29 [2022-07-21 02:09:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:09:46,772 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2022-07-21 02:09:46,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 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-21 02:09:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2022-07-21 02:09:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 02:09:46,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:09:46,773 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, 1, 1, 1, 1, 1, 1] [2022-07-21 02:09:46,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-21 02:09:46,987 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,SelfDestructingSolverStorable17 [2022-07-21 02:09:46,987 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:09:46,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:09:46,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1842471721, now seen corresponding path program 1 times [2022-07-21 02:09:46,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:09:46,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650709532] [2022-07-21 02:09:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:09:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:09:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:09:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:09:47,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:09:47,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650709532] [2022-07-21 02:09:47,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650709532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:09:47,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:09:47,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:09:47,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414978949] [2022-07-21 02:09:47,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:09:47,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:09:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:09:47,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:09:47,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:09:47,040 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:09:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:09:47,233 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2022-07-21 02:09:47,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:09:47,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-21 02:09:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:09:47,234 INFO L225 Difference]: With dead ends: 150 [2022-07-21 02:09:47,234 INFO L226 Difference]: Without dead ends: 139 [2022-07-21 02:09:47,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:09:47,234 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:09:47,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 107 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 02:09:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-21 02:09:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2022-07-21 02:09:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 1.2419354838709677) internal successors, (154), 125 states have internal predecessors, (154), 0 states have call successors, (0), 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-21 02:09:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2022-07-21 02:09:47,241 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 29 [2022-07-21 02:09:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:09:47,241 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2022-07-21 02:09:47,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:09:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2022-07-21 02:09:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 02:09:47,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:09:47,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:09:47,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 02:09:47,242 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:09:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:09:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash -461850395, now seen corresponding path program 1 times [2022-07-21 02:09:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:09:47,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171908729] [2022-07-21 02:09:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:09:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:09:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:09:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:09:47,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:09:47,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171908729] [2022-07-21 02:09:47,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171908729] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:09:47,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968356632] [2022-07-21 02:09:47,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:09:47,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:09:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:09:47,424 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-21 02:09:47,425 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-21 02:09:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:09:47,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-21 02:09:47,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:09:47,671 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:09:47,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 35 treesize of output 34 [2022-07-21 02:09:47,679 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-21 02:09:47,685 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:09:47,685 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 11 treesize of output 11 [2022-07-21 02:09:47,688 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 11 treesize of output 7 [2022-07-21 02:09:47,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:47,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 02:09:47,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:47,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 02:09:47,819 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 21 treesize of output 20 [2022-07-21 02:09:47,822 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 27 treesize of output 26 [2022-07-21 02:09:47,876 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 32 treesize of output 30 [2022-07-21 02:09:47,883 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:09:47,884 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-07-21 02:09:47,886 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 7 [2022-07-21 02:09:47,887 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 24 treesize of output 18 [2022-07-21 02:09:47,903 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-21 02:09:47,905 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-21 02:09:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:09:47,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:09:47,962 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3239 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_3239) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0))) 0)) (forall ((v_ArrVal_3240 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_3240) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse1)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse1))) 0))) is different from false [2022-07-21 02:09:47,966 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3239 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3239) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0))) 0)) (forall ((v_ArrVal_3240 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3240) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1))) 0))) is different from false [2022-07-21 02:09:47,978 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3239 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse2 |c_ULTIMATE.start_main_~item~0#1.base|)))) (select (store .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3239) (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_3240 (Array Int Int))) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse4 |c_ULTIMATE.start_main_~item~0#1.offset|))) (.cse5 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (select (select (store .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3240) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse4 |c_ULTIMATE.start_main_~item~0#1.base|)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5)) (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5)))) 0))) is different from false [2022-07-21 02:09:48,024 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3240 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3240) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_3239 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3239) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) is different from false [2022-07-21 02:09:48,030 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3239 (Array Int Int)) (v_ArrVal_3231 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_3231)) |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3239) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (forall ((v_ArrVal_3240 (Array Int Int)) (v_ArrVal_3233 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_3233)) |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_3240) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) is different from false [2022-07-21 02:09:48,036 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:09:48,037 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2022-07-21 02:09:48,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-21 02:09:48,042 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:09:48,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 1 [2022-07-21 02:09:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 02:09:48,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968356632] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:09:48,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:09:48,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2022-07-21 02:09:48,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643121804] [2022-07-21 02:09:48,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:09:48,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 02:09:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:09:48,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 02:09:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=227, Unknown=5, NotChecked=170, Total=462 [2022-07-21 02:09:48,058 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:09:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:09:48,718 INFO L93 Difference]: Finished difference Result 281 states and 344 transitions. [2022-07-21 02:09:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 02:09:48,720 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-21 02:09:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:09:48,721 INFO L225 Difference]: With dead ends: 281 [2022-07-21 02:09:48,721 INFO L226 Difference]: Without dead ends: 270 [2022-07-21 02:09:48,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=623, Unknown=5, NotChecked=290, Total=1122 [2022-07-21 02:09:48,722 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 288 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 02:09:48,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 404 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 425 Invalid, 0 Unknown, 531 Unchecked, 0.4s Time] [2022-07-21 02:09:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-21 02:09:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 172. [2022-07-21 02:09:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.2588235294117647) internal successors, (214), 171 states have internal predecessors, (214), 0 states have call successors, (0), 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-21 02:09:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 214 transitions. [2022-07-21 02:09:48,731 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 214 transitions. Word has length 29 [2022-07-21 02:09:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:09:48,731 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 214 transitions. [2022-07-21 02:09:48,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:09:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 214 transitions. [2022-07-21 02:09:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 02:09:48,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:09:48,732 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:09:48,751 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-21 02:09:48,932 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,SelfDestructingSolverStorable19 [2022-07-21 02:09:48,933 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-21 02:09:48,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:09:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash -993211820, now seen corresponding path program 1 times [2022-07-21 02:09:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:09:48,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429293444] [2022-07-21 02:09:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:09:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:09:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:09:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:09:49,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:09:49,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429293444] [2022-07-21 02:09:49,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429293444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:09:49,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000674225] [2022-07-21 02:09:49,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:09:49,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:09:49,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:09:49,059 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-21 02:09:49,062 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-21 02:09:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:09:49,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 123 conjunts are in the unsatisfiable core [2022-07-21 02:09:49,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:09:49,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-07-21 02:09:49,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,309 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-07-21 02:09:49,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,314 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-07-21 02:09:49,331 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-21 02:09:49,331 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 99 [2022-07-21 02:09:49,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-07-21 02:09:49,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-07-21 02:09:49,363 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-21 02:09:49,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-07-21 02:09:49,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:09:49,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-07-21 02:09:49,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:09:49,446 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-21 02:09:49,447 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 74 [2022-07-21 02:09:49,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-07-21 02:09:49,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,464 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-21 02:09:49,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 02:09:49,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:09:49,545 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-21 02:09:49,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:09:49,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:09:49,563 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-21 02:09:49,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 99 treesize of output 85 [2022-07-21 02:09:49,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:49,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2022-07-21 02:09:49,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:09:49,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-07-21 02:09:50,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:50,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:50,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:50,281 INFO L356 Elim1Store]: treesize reduction 182, result has 29.7 percent of original size [2022-07-21 02:09:50,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 74 treesize of output 107 [2022-07-21 02:09:50,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:50,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:09:50,349 INFO L356 Elim1Store]: treesize reduction 126, result has 35.7 percent of original size [2022-07-21 02:09:50,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 128 treesize of output 134 [2022-07-21 02:09:52,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 79 [2022-07-21 02:09:52,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2022-07-21 02:09:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:09:52,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:09:54,659 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3479 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) |c_ULTIMATE.start_main_~itr~0#1.offset| v_ArrVal_3479)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) |c_ULTIMATE.start_main_~itr~0#1.offset| v_ArrVal_3480)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2022-07-21 02:09:56,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int)) (or (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)))) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3479 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3479)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3480)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2022-07-21 02:10:06,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:10:06,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 19 [2022-07-21 02:10:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:10:09,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000674225] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:10:09,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:10:09,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 29 [2022-07-21 02:10:09,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330725155] [2022-07-21 02:10:09,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:10:09,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 02:10:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:10:09,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 02:10:09,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=602, Unknown=2, NotChecked=102, Total=812 [2022-07-21 02:10:09,751 INFO L87 Difference]: Start difference. First operand 172 states and 214 transitions. Second operand has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 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-21 02:10:11,871 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse17))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse17)) (.cse24 (select .cse3 0)) (.cse16 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse1 (= (select .cse0 .cse2) 0) (or (forall ((|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int)) (or (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)))) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3479 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3479)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3480)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (and .cse1 (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0))) (= (select .cse3 4) 0) (= (select .cse4 0) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (exists ((v_arrayElimIndex_53 Int) (|ULTIMATE.start_main_~item~0#1.base| Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_53)) (.cse13 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_53))) (and (let ((.cse12 (select .cse14 0))) (let ((.cse9 (= (select .cse13 0) 0)) (.cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (.cse10 (not (= .cse12 v_arrayElimIndex_53))) (.cse7 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimIndex_53)) (.cse11 (not (= .cse12 |c_ULTIMATE.start_main_~bucket~0#1.base|)))) (or (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (let ((.cse8 (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (or (and .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse8)))) (and .cse9 .cse6 .cse10 .cse7 .cse11)))) (not (= |ULTIMATE.start_main_~item~0#1.base| v_arrayElimIndex_53)) (not (= v_arrayElimIndex_53 0)) (= (select .cse14 4) 0) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| v_arrayElimIndex_53)) (not (= |ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse13 4) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse15 .cse2) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse16) 0) (= (select |c_#valid| .cse17) 1) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) 1)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5) 1) (forall ((|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int) (v_ArrVal_3477 Int) (v_ArrVal_3473 Int)) (let ((.cse23 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse23 v_ArrVal_3477)))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse23 v_ArrVal_3473)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse19 (select (select .cse22 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (and (= .cse18 0) (= .cse19 0)) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int)) (= (select (select (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_3477)))) (store .cse20 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse20 |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3480))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3479 Int)) (= 0 (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_3473)))) (store .cse21 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse21 |ULTIMATE.start_main_~itr~0#1.base|) |v_ULTIMATE.start_main_~itr~0#1.offset_33| v_ArrVal_3479))) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))))) (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (select (select .cse22 .cse18) (+ .cse19 4)))))))))) (not (= .cse17 |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse24 .cse17)) (= (select .cse4 4) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) (not (= .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse16) 0)))))) is different from false