./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 6c24879c 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-?-6c24879 [2022-07-12 03:20:42,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:20:42,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:20:42,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:20:42,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:20:42,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:20:42,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:20:42,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:20:42,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:20:42,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:20:42,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:20:42,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:20:42,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:20:42,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:20:42,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:20:42,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:20:42,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:20:42,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:20:42,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:20:42,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:20:42,596 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:20:42,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:20:42,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:20:42,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:20:42,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:20:42,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:20:42,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:20:42,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:20:42,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:20:42,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:20:42,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:20:42,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:20:42,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:20:42,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:20:42,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:20:42,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:20:42,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:20:42,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:20:42,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:20:42,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:20:42,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:20:42,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:20:42,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:20:42,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:20:42,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:20:42,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:20:42,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:20:42,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:20:42,635 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:20:42,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:20:42,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:20:42,636 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:20:42,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:20:42,637 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:20:42,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:20:42,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:20:42,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:20:42,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:20:42,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:20:42,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:20:42,638 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:20:42,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:20:42,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:20:42,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:20:42,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:20:42,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:20:42,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:20:42,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:42,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:20:42,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:20:42,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:20:42,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:20:42,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:20:42,641 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:20:42,641 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:20:42,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:20:42,641 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-12 03:20:42,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:20:42,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:20:42,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:20:42,961 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:20:42,983 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:20:42,984 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-12 03:20:43,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00a8598d6/df9eb2f9c95a434bbfaab2156bf62b91/FLAGda4bf368c [2022-07-12 03:20:43,557 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:20:43,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2022-07-12 03:20:43,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00a8598d6/df9eb2f9c95a434bbfaab2156bf62b91/FLAGda4bf368c [2022-07-12 03:20:44,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00a8598d6/df9eb2f9c95a434bbfaab2156bf62b91 [2022-07-12 03:20:44,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:20:44,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:20:44,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:44,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:20:44,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:20:44,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac0813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44, skipping insertion in model container [2022-07-12 03:20:44,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:20:44,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:20:44,317 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-12 03:20:44,320 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-12 03:20:44,322 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-12 03:20:44,329 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-12 03:20:44,330 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-12 03:20:44,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:44,342 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:20:44,391 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-12 03:20:44,392 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-12 03:20:44,393 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-12 03:20:44,395 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-12 03:20:44,395 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-12 03:20:44,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:44,414 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:20:44,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44 WrapperNode [2022-07-12 03:20:44,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:44,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:44,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:20:44,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:20:44,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,446 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2022-07-12 03:20:44,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:44,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:20:44,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:20:44,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:20:44,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:20:44,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:20:44,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:20:44,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:20:44,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (1/1) ... [2022-07-12 03:20:44,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:44,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:44,521 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-12 03:20:44,556 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-12 03:20:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:20:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:20:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:20:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:20:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:20:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:20:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:20:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:20:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:20:44,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:20:44,706 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:20:44,708 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:20:44,938 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:20:44,943 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:20:44,943 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-07-12 03:20:44,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:44 BoogieIcfgContainer [2022-07-12 03:20:44,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:20:44,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:20:44,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:20:44,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:20:44,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:20:44" (1/3) ... [2022-07-12 03:20:44,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a7e6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:44, skipping insertion in model container [2022-07-12 03:20:44,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:44" (2/3) ... [2022-07-12 03:20:44,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a7e6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:44, skipping insertion in model container [2022-07-12 03:20:44,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:44" (3/3) ... [2022-07-12 03:20:44,950 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2022-07-12 03:20:44,959 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:20:44,960 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-07-12 03:20:44,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:20:44,996 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@2b06143e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@364aad5e [2022-07-12 03:20:44,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-12 03:20:44,998 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-12 03:20:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 03:20:45,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:45,003 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-12 03:20:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2022-07-12 03:20:45,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238583796] [2022-07-12 03:20:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:45,215 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-12 03:20:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:45,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238583796] [2022-07-12 03:20:45,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238583796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:45,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:45,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877180278] [2022-07-12 03:20:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:45,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:45,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:45,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:45,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:45,242 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-12 03:20:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:45,312 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2022-07-12 03:20:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:45,314 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-12 03:20:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:45,320 INFO L225 Difference]: With dead ends: 112 [2022-07-12 03:20:45,320 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 03:20:45,323 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-12 03:20:45,326 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-12 03:20:45,327 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-12 03:20:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 03:20:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2022-07-12 03:20:45,352 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-12 03:20:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-07-12 03:20:45,355 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2022-07-12 03:20:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:45,355 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-07-12 03:20:45,355 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-12 03:20:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-07-12 03:20:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:20:45,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:45,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:20:45,356 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-12 03:20:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2022-07-12 03:20:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843369652] [2022-07-12 03:20:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:45,462 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-12 03:20:45,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:45,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843369652] [2022-07-12 03:20:45,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843369652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:45,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:45,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766432179] [2022-07-12 03:20:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:45,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:45,466 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-12 03:20:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:45,505 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-07-12 03:20:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:45,505 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-12 03:20:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:45,506 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:20:45,506 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 03:20:45,506 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-12 03:20:45,507 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-12 03:20:45,507 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-12 03:20:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 03:20:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-12 03:20:45,510 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-12 03:20:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-12 03:20:45,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2022-07-12 03:20:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:45,511 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-12 03:20:45,511 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-12 03:20:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-12 03:20:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:20:45,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:45,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:20:45,512 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-12 03:20:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2022-07-12 03:20:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341186954] [2022-07-12 03:20:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:45,598 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-12 03:20:45,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:45,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341186954] [2022-07-12 03:20:45,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341186954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:45,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:45,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:45,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712559684] [2022-07-12 03:20:45,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:45,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:45,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:45,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:45,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:45,600 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-12 03:20:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:45,679 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-07-12 03:20:45,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:20:45,679 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-12 03:20:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:45,681 INFO L225 Difference]: With dead ends: 61 [2022-07-12 03:20:45,681 INFO L226 Difference]: Without dead ends: 50 [2022-07-12 03:20:45,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:20:45,682 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:45,682 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.0s Time] [2022-07-12 03:20:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-12 03:20:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-07-12 03:20:45,686 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-12 03:20:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-07-12 03:20:45,687 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2022-07-12 03:20:45,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:45,687 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-07-12 03:20:45,687 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-12 03:20:45,687 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-07-12 03:20:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:20:45,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:45,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:20:45,688 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-12 03:20:45,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,690 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2022-07-12 03:20:45,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726429218] [2022-07-12 03:20:45,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:45,751 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-12 03:20:45,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:45,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726429218] [2022-07-12 03:20:45,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726429218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:45,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:45,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057247702] [2022-07-12 03:20:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:45,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:45,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:45,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:45,756 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-12 03:20:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:45,803 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-07-12 03:20:45,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:45,803 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-12 03:20:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:45,804 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:20:45,804 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 03:20:45,804 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-12 03:20:45,808 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:45,808 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.0s Time] [2022-07-12 03:20:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 03:20:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-07-12 03:20:45,813 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-12 03:20:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-07-12 03:20:45,813 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2022-07-12 03:20:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:45,813 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-07-12 03:20:45,813 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-12 03:20:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-07-12 03:20:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:20:45,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,815 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:45,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:20:45,815 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-12 03:20:45,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,816 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2022-07-12 03:20:45,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568009743] [2022-07-12 03:20:45,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:46,029 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-12 03:20:46,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:46,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568009743] [2022-07-12 03:20:46,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568009743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:46,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171039582] [2022-07-12 03:20:46,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:46,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:46,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:46,032 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-12 03:20:46,033 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-12 03:20:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:46,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 03:20:46,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:46,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,264 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-12 03:20:46,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,274 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-12 03:20:46,302 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-12 03:20:46,302 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-12 03:20:46,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 03:20:46,323 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-12 03:20:46,336 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:20:46,336 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-12 03:20:46,368 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-12 03:20:46,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,487 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-12 03:20:46,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:46,499 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 03:20:46,499 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-12 03:20:46,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:46,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:46,606 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-12 03:20:46,614 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-12 03:20:46,614 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-12 03:20:46,626 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-12 03:20:46,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:46,780 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:20:46,781 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-12 03:20:46,786 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:20:46,786 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-12 03:20:46,787 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-12 03:20:46,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171039582] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:46,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:46,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-12 03:20:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975770241] [2022-07-12 03:20:46,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:46,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 03:20:46,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:46,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 03:20:46,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:20:46,789 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-12 03:20:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:47,109 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-07-12 03:20:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:20:47,109 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-12 03:20:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:47,110 INFO L225 Difference]: With dead ends: 64 [2022-07-12 03:20:47,110 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 03:20:47,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2022-07-12 03:20:47,111 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-12 03:20:47,111 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-12 03:20:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 03:20:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-07-12 03:20:47,114 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-12 03:20:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-07-12 03:20:47,115 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2022-07-12 03:20:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:47,115 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-07-12 03:20:47,115 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-12 03:20:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-07-12 03:20:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:20:47,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:47,116 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:47,134 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-12 03:20:47,325 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-12 03:20:47,325 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-12 03:20:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:47,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2022-07-12 03:20:47,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:47,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050160462] [2022-07-12 03:20:47,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:47,445 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-12 03:20:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:47,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050160462] [2022-07-12 03:20:47,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050160462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:47,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913666024] [2022-07-12 03:20:47,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:47,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:47,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:47,457 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-12 03:20:47,508 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-12 03:20:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:47,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 03:20:47,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:47,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:47,645 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-12 03:20:47,661 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-12 03:20:47,662 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-12 03:20:47,684 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-12 03:20:47,684 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-12 03:20:47,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:47,724 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-12 03:20:47,733 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 03:20:47,733 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-12 03:20:47,758 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-12 03:20:47,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:47,816 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-12 03:20:47,820 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-12 03:20:47,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:47,838 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-12 03:20:47,865 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-12 03:20:47,906 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-12 03:20:47,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913666024] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:47,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:47,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-07-12 03:20:47,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263584755] [2022-07-12 03:20:47,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:47,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:20:47,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:47,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:20:47,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2022-07-12 03:20:47,908 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-12 03:20:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:48,266 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2022-07-12 03:20:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:20:48,266 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-12 03:20:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:48,267 INFO L225 Difference]: With dead ends: 155 [2022-07-12 03:20:48,267 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 03:20:48,267 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-12 03:20:48,268 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:48,268 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.2s Time] [2022-07-12 03:20:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 03:20:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 71. [2022-07-12 03:20:48,273 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-12 03:20:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2022-07-12 03:20:48,273 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 16 [2022-07-12 03:20:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:48,273 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2022-07-12 03:20:48,274 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-12 03:20:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-07-12 03:20:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:20:48,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:48,274 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:48,293 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-12 03:20:48,486 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-12 03:20:48,486 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-12 03:20:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:48,487 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2022-07-12 03:20:48,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:48,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476547514] [2022-07-12 03:20:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:48,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:48,583 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-12 03:20:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:48,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476547514] [2022-07-12 03:20:48,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476547514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:48,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474449497] [2022-07-12 03:20:48,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:20:48,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:48,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:48,585 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-12 03:20:48,586 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-12 03:20:48,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:20:48,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:20:48,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-12 03:20:48,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:48,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:48,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:48,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:48,817 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-12 03:20:48,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:48,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:48,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:48,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, 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-12 03:20:48,837 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-12 03:20:48,838 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-12 03:20:48,894 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 03:20:48,895 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-12 03:20:48,900 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-12 03:20:48,915 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-12 03:20:48,973 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-12 03:20:48,985 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-12 03:20:48,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:48,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474449497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:48,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:20:48,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-12 03:20:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86429717] [2022-07-12 03:20:48,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:48,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:20:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:48,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:20:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:20:48,987 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-12 03:20:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:49,145 INFO L93 Difference]: Finished difference Result 138 states and 171 transitions. [2022-07-12 03:20:49,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:20:49,146 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-12 03:20:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:49,146 INFO L225 Difference]: With dead ends: 138 [2022-07-12 03:20:49,146 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 03:20:49,147 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-12 03:20:49,147 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:49,147 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.1s Time] [2022-07-12 03:20:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 03:20:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2022-07-12 03:20:49,152 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-12 03:20:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-07-12 03:20:49,152 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 18 [2022-07-12 03:20:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:49,152 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-07-12 03:20:49,152 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-12 03:20:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-07-12 03:20:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:20:49,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:49,153 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:49,185 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-12 03:20:49,353 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-12 03:20:49,354 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-12 03:20:49,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:49,354 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2022-07-12 03:20:49,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:49,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743045935] [2022-07-12 03:20:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:49,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:49,459 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-12 03:20:49,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:49,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743045935] [2022-07-12 03:20:49,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743045935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:49,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550118131] [2022-07-12 03:20:49,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:49,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:49,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:49,460 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-12 03:20:49,461 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-12 03:20:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:49,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 03:20:49,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:49,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:49,587 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-12 03:20:49,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:49,591 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-12 03:20:49,607 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-12 03:20:49,608 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-12 03:20:49,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:49,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:49,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:49,614 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-12 03:20:49,634 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-12 03:20:49,634 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-12 03:20:49,640 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-12 03:20:49,645 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-12 03:20:49,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:49,956 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 03:20:49,956 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-12 03:20:49,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:49,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:49,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:49,961 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-12 03:20:49,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:49,971 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-12 03:20:49,971 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-12 03:20:50,023 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 03:20:50,023 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-12 03:20:50,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:50,033 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-12 03:20:50,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:50,133 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-12 03:20:50,173 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:20:50,174 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-12 03:20:50,178 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-12 03:20:50,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:50,211 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-12 03:20:50,223 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-12 03:20:50,261 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-12 03:20:50,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550118131] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:50,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:50,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-12 03:20:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082132974] [2022-07-12 03:20:50,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:50,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 03:20:50,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:50,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 03:20:50,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=195, Unknown=2, NotChecked=58, Total=306 [2022-07-12 03:20:50,263 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-12 03:20:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:50,855 INFO L93 Difference]: Finished difference Result 127 states and 156 transitions. [2022-07-12 03:20:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:20:50,855 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-12 03:20:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:50,856 INFO L225 Difference]: With dead ends: 127 [2022-07-12 03:20:50,856 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 03:20:50,856 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-12 03:20:50,857 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-12 03:20:50,857 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-12 03:20:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 03:20:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 80. [2022-07-12 03:20:50,862 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-12 03:20:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2022-07-12 03:20:50,862 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 19 [2022-07-12 03:20:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:50,862 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2022-07-12 03:20:50,862 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-12 03:20:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-07-12 03:20:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:20:50,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:50,863 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:50,883 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-12 03:20:51,080 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-12 03:20:51,081 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-12 03:20:51,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2022-07-12 03:20:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:51,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085851361] [2022-07-12 03:20:51,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:51,335 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-12 03:20:51,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:51,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085851361] [2022-07-12 03:20:51,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085851361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:51,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964805203] [2022-07-12 03:20:51,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:20:51,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:51,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:51,337 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-12 03:20:51,386 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-12 03:20:51,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:20:51,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:20:51,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-12 03:20:51,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:51,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:51,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 03:20:51,793 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-12 03:20:51,793 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-12 03:20:51,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:51,797 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-12 03:20:51,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:51,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:51,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:51,804 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-12 03:20:51,809 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-12 03:20:51,812 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-12 03:20:51,816 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-12 03:20:51,820 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-12 03:20:51,825 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 03:20:51,825 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-12 03:20:51,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:51,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:51,930 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 03:20:51,931 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-12 03:20:51,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:51,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:51,936 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-12 03:20:52,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:52,046 INFO L356 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2022-07-12 03:20:52,046 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-12 03:20:52,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:52,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:52,056 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 03:20:52,056 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-12 03:20:52,192 INFO L356 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-07-12 03:20:52,192 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-12 03:20:52,199 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:20:52,200 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-12 03:20:52,204 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-12 03:20:52,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:59,021 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:20:59,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 03:20:59,028 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:20:59,028 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-12 03:20:59,030 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-12 03:20:59,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964805203] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:59,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:59,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-07-12 03:20:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563885856] [2022-07-12 03:20:59,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:59,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 03:20:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:59,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 03:20:59,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=278, Unknown=2, NotChecked=0, Total=342 [2022-07-12 03:20:59,032 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-12 03:20:59,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:59,498 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-07-12 03:20:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:20:59,499 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-12 03:20:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:59,499 INFO L225 Difference]: With dead ends: 97 [2022-07-12 03:20:59,499 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 03:20:59,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=117, Invalid=433, Unknown=2, NotChecked=0, Total=552 [2022-07-12 03:20:59,500 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:59,500 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.2s Time] [2022-07-12 03:20:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 03:20:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-07-12 03:20:59,504 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-12 03:20:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-07-12 03:20:59,505 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 20 [2022-07-12 03:20:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:59,505 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-07-12 03:20:59,505 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-12 03:20:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-07-12 03:20:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 03:20:59,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:59,505 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:59,537 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-12 03:20:59,727 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-12 03:20:59,727 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-12 03:20:59,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash 220535656, now seen corresponding path program 2 times [2022-07-12 03:20:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:59,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944426435] [2022-07-12 03:20:59,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:59,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:59,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-12 03:20:59,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:59,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944426435] [2022-07-12 03:20:59,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944426435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:59,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334005418] [2022-07-12 03:20:59,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:20:59,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:59,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:59,980 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-12 03:21:00,005 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-12 03:21:00,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:21:00,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:21:00,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-12 03:21:00,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:00,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:00,371 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-12 03:21:00,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:00,378 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-12 03:21:00,396 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-12 03:21:00,397 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-12 03:21:00,401 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-12 03:21:00,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:00,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:00,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:00,419 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-12 03:21:00,442 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-12 03:21:00,442 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-12 03:21:00,448 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-12 03:21:00,451 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-12 03:21:00,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:00,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:00,526 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-12 03:21:00,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:00,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 03:21:00,547 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-12 03:21:00,548 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-12 03:21:00,551 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-12 03:21:00,619 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-12 03:21:00,623 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-12 03:21:00,625 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-12 03:21:00,786 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-12 03:21:00,789 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-12 03:21:00,811 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-12 03:21:00,824 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-12 03:21:00,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:21:00,864 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-12 03:21:00,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:21:00,872 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-12 03:21:00,920 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-12 03:21:00,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334005418] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:21:00,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:21:00,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-12 03:21:00,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042189851] [2022-07-12 03:21:00,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:21:00,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 03:21:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:21:00,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 03:21:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=228, Unknown=1, NotChecked=30, Total=306 [2022-07-12 03:21:00,922 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-12 03:21:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:01,480 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2022-07-12 03:21:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:21:01,481 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-12 03:21:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:01,481 INFO L225 Difference]: With dead ends: 165 [2022-07-12 03:21:01,481 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 03:21:01,482 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-12 03:21:01,482 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:01,482 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.4s Time] [2022-07-12 03:21:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 03:21:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2022-07-12 03:21:01,487 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-12 03:21:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-07-12 03:21:01,488 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 21 [2022-07-12 03:21:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:01,488 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-07-12 03:21:01,488 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-12 03:21:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-07-12 03:21:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 03:21:01,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:01,489 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:21:01,510 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-12 03:21:01,699 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-12 03:21:01,699 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-12 03:21:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2022-07-12 03:21:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:21:01,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673112946] [2022-07-12 03:21:01,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:01,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:21:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:01,856 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-12 03:21:01,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:21:01,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673112946] [2022-07-12 03:21:01,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673112946] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:21:01,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046216824] [2022-07-12 03:21:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:01,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:21:01,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:21:01,858 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-12 03:21:01,860 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-12 03:21:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:01,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-12 03:21:01,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:02,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,019 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-12 03:21:02,038 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-12 03:21:02,038 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-12 03:21:02,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,046 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-12 03:21:02,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,056 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-12 03:21:02,081 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-12 03:21:02,081 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-12 03:21:02,088 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-12 03:21:02,092 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-12 03:21:02,096 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-12 03:21:02,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,172 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-12 03:21:02,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,184 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 03:21:02,184 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-12 03:21:02,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,204 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-12 03:21:02,205 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-12 03:21:02,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, 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-12 03:21:02,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:02,345 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-12 03:21:02,366 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 03:21:02,366 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-12 03:21:02,371 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-12 03:21:02,839 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:21:02,840 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-12 03:21:02,865 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-12 03:21:02,866 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-12 03:21:02,893 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-12 03:21:02,922 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-12 03:21:02,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:21:03,011 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-12 03:21:03,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:21:03,022 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-12 03:21:03,126 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-12 03:21:03,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046216824] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:21:03,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:21:03,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-07-12 03:21:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399020990] [2022-07-12 03:21:03,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:21:03,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 03:21:03,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:21:03,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 03:21:03,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2022-07-12 03:21:03,129 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-12 03:21:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:04,132 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2022-07-12 03:21:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:21:04,132 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-12 03:21:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:04,133 INFO L225 Difference]: With dead ends: 162 [2022-07-12 03:21:04,133 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 03:21:04,134 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-12 03:21:04,135 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 125 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:04,135 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.7s Time] [2022-07-12 03:21:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 03:21:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2022-07-12 03:21:04,150 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-12 03:21:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-07-12 03:21:04,152 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 21 [2022-07-12 03:21:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:04,152 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-07-12 03:21:04,153 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-12 03:21:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-07-12 03:21:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:21:04,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:04,156 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-12 03:21:04,174 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-12 03:21:04,371 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-12 03:21:04,371 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-12 03:21:04,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:04,371 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2022-07-12 03:21:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:21:04,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014712961] [2022-07-12 03:21:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:04,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:21:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:04,586 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-12 03:21:04,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:21:04,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014712961] [2022-07-12 03:21:04,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014712961] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:21:04,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867948932] [2022-07-12 03:21:04,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:04,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:21:04,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:21:04,588 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-12 03:21:04,589 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-12 03:21:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:04,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 03:21:04,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:04,755 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-12 03:21:04,755 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-12 03:21:04,788 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:21:04,789 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-12 03:21:04,805 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-12 03:21:04,955 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-12 03:21:04,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:04,960 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-12 03:21:04,962 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-12 03:21:05,012 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-12 03:21:05,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:05,017 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-12 03:21:05,018 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-12 03:21:05,065 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-12 03:21:05,067 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-12 03:21:05,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:21:05,138 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-12 03:21:05,140 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-12 03:21:11,691 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-12 03:21:11,746 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-12 03:21:11,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867948932] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:21:11,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:21:11,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 29 [2022-07-12 03:21:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314402293] [2022-07-12 03:21:11,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:21:11,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 03:21:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:21:11,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 03:21:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=703, Unknown=1, NotChecked=0, Total=812 [2022-07-12 03:21:11,747 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-12 03:21:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:12,095 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2022-07-12 03:21:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:21:12,095 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-12 03:21:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:12,096 INFO L225 Difference]: With dead ends: 120 [2022-07-12 03:21:12,096 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 03:21:12,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=156, Invalid=1033, Unknown=1, NotChecked=0, Total=1190 [2022-07-12 03:21:12,097 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 112 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:12,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 308 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2022-07-12 03:21:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 03:21:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2022-07-12 03:21:12,102 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-12 03:21:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2022-07-12 03:21:12,103 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 24 [2022-07-12 03:21:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:12,103 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2022-07-12 03:21:12,103 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-12 03:21:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2022-07-12 03:21:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:21:12,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:12,104 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:21:12,137 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-12 03:21:12,314 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-12 03:21:12,314 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-12 03:21:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1317906679, now seen corresponding path program 3 times [2022-07-12 03:21:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:21:12,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781859878] [2022-07-12 03:21:12,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:21:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:12,546 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-12 03:21:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:21:12,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781859878] [2022-07-12 03:21:12,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781859878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:21:12,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641073685] [2022-07-12 03:21:12,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:21:12,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:21:12,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:21:12,552 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-12 03:21:12,553 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-12 03:21:13,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 03:21:13,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:21:13,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-12 03:21:13,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:13,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:13,939 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-12 03:21:13,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:13,944 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-12 03:21:13,960 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-12 03:21:13,960 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-12 03:21:13,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:13,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:13,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:13,965 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-12 03:21:13,970 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-12 03:21:13,974 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-12 03:21:13,979 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-12 03:21:14,012 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-12 03:21:14,019 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 03:21:14,019 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-12 03:21:14,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:14,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:14,090 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-12 03:21:14,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:14,095 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 03:21:14,096 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-12 03:21:14,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:14,179 INFO L356 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-07-12 03:21:14,180 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-12 03:21:14,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:14,185 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 03:21:14,185 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-12 03:21:14,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:14,338 INFO L356 Elim1Store]: treesize reduction 168, result has 21.1 percent of original size [2022-07-12 03:21:14,338 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-12 03:21:14,361 INFO L356 Elim1Store]: treesize reduction 108, result has 16.9 percent of original size [2022-07-12 03:21:14,362 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-12 03:21:14,452 INFO L356 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2022-07-12 03:21:14,452 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-12 03:21:14,462 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-12 03:21:14,462 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-12 03:21:14,466 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-12 03:21:14,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:21:19,786 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2073 Int) (v_ArrVal_2069 Int) (v_ArrVal_2071 Int)) (= (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse4 .cse5 v_ArrVal_2071)))) (let ((.cse2 (select .cse0 .cse1))) (select (store .cse0 .cse1 (store .cse2 (+ .cse3 4) v_ArrVal_2073)) (select .cse2 .cse3)))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse6 .cse5 v_ArrVal_2069)) .cse1) .cse3)))) 0)) (forall ((v_ArrVal_2075 Int) (v_ArrVal_2069 Int) (v_ArrVal_2071 Int)) (= (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse13 .cse12 v_ArrVal_2069))) (.cse8 (select .cse11 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse9 (select .cse7 .cse8)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store .cse7 .cse8 (store .cse9 (+ .cse10 4) v_ArrVal_2075)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse11 .cse12 v_ArrVal_2071)) .cse8) .cse10)) (select .cse9 .cse10))))) 0))) is different from false [2022-07-12 03:21:19,832 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:19,833 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-12 03:21:19,851 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:21:19,851 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-12 03:21:19,852 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-12 03:21:19,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641073685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:21:19,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:21:19,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2022-07-12 03:21:19,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962783289] [2022-07-12 03:21:19,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:21:19,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 03:21:19,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:21:19,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 03:21:19,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=222, Unknown=2, NotChecked=30, Total=306 [2022-07-12 03:21:19,853 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-12 03:21:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:20,057 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2022-07-12 03:21:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:21:20,058 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-12 03:21:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:20,058 INFO L225 Difference]: With dead ends: 122 [2022-07-12 03:21:20,058 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 03:21:20,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=66, Invalid=278, Unknown=2, NotChecked=34, Total=380 [2022-07-12 03:21:20,059 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:20,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 206 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 83 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2022-07-12 03:21:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 03:21:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-12 03:21:20,063 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-12 03:21:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-07-12 03:21:20,063 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 25 [2022-07-12 03:21:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:20,063 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-07-12 03:21:20,063 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-12 03:21:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-07-12 03:21:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:21:20,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:20,064 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-12 03:21:20,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 03:21:20,275 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-12 03:21:20,275 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-12 03:21:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash 352741712, now seen corresponding path program 1 times [2022-07-12 03:21:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:21:20,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944555768] [2022-07-12 03:21:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:21:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:20,355 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-12 03:21:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:21:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944555768] [2022-07-12 03:21:20,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944555768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:21:20,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:21:20,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:21:20,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263491549] [2022-07-12 03:21:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:21:20,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:21:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:21:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:21:20,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:21:20,357 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-12 03:21:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:20,567 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2022-07-12 03:21:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:21:20,567 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-12 03:21:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:20,568 INFO L225 Difference]: With dead ends: 150 [2022-07-12 03:21:20,568 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 03:21:20,568 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-12 03:21:20,569 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 49 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:20,569 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.1s Time] [2022-07-12 03:21:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 03:21:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2022-07-12 03:21:20,572 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-12 03:21:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2022-07-12 03:21:20,573 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 25 [2022-07-12 03:21:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:20,573 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2022-07-12 03:21:20,573 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-12 03:21:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2022-07-12 03:21:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:21:20,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:20,573 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-12 03:21:20,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 03:21:20,574 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-12 03:21:20,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2022-07-12 03:21:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:21:20,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312563547] [2022-07-12 03:21:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:20,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:21:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:20,757 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-12 03:21:20,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:21:20,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312563547] [2022-07-12 03:21:20,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312563547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:21:20,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15852088] [2022-07-12 03:21:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:20,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:21:20,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:21:20,760 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-12 03:21:20,775 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-12 03:21:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:20,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-12 03:21:20,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:21,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:21,002 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-12 03:21:21,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:21,006 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-12 03:21:21,025 INFO L356 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2022-07-12 03:21:21,025 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-12 03:21:21,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:21,043 INFO L356 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2022-07-12 03:21:21,043 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-12 03:21:21,046 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-12 03:21:21,050 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-12 03:21:21,058 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-12 03:21:21,065 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-12 03:21:21,083 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-12 03:21:21,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:21,104 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-12 03:21:21,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:21,124 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 56 treesize of output 40 [2022-07-12 03:21:21,164 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 56 treesize of output 46 [2022-07-12 03:21:21,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:21,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:21:21,472 INFO L356 Elim1Store]: treesize reduction 140, result has 60.7 percent of original size [2022-07-12 03:21:21,473 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 206 treesize of output 372 [2022-07-12 03:21:21,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:21,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:21:21,559 INFO L356 Elim1Store]: treesize reduction 92, result has 58.2 percent of original size [2022-07-12 03:21:21,560 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 383 treesize of output 388 [2022-07-12 03:21:31,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:21:31,544 INFO L356 Elim1Store]: treesize reduction 798, result has 10.2 percent of original size [2022-07-12 03:21:31,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 1 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 123 case distinctions, treesize of input 484 treesize of output 529 [2022-07-12 03:21:31,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:21:31,770 INFO L356 Elim1Store]: treesize reduction 538, result has 12.8 percent of original size [2022-07-12 03:21:31,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 1 disjoint index pairs (out of 120 index pairs), introduced 18 new quantified variables, introduced 124 case distinctions, treesize of input 547 treesize of output 530 [2022-07-12 03:22:09,365 WARN L233 SmtUtils]: Spent 5.54s on a formula simplification. DAG size of input: 664 DAG size of output: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:22:10,515 INFO L356 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-07-12 03:22:10,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 182 treesize of output 176 [2022-07-12 03:22:10,521 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:22:10,522 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 136 treesize of output 115 [2022-07-12 03:22:10,549 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 107 treesize of output 101 [2022-07-12 03:22:10,595 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 96 treesize of output 86 [2022-07-12 03:22:10,678 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-12 03:22:10,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:22:10,681 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-12 03:22:10,700 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-12 03:22:10,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:22:10,751 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-12 03:22:13,145 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (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)) (= (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))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2397 Int) (v_ArrVal_2400 (Array Int Int))) (= (select (select (let ((.cse1 (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 .cse1 (select (select .cse1 |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)) (forall ((v_ArrVal_2395 Int)) (= (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)))) (forall ((v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2395 Int) (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)) (= (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))) (forall ((v_ArrVal_2395 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2397 Int) (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)) (= (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)))) is different from false [2022-07-12 03:22:13,199 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:22:13,204 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:22:13,204 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 229 treesize of output 1 [2022-07-12 03:22:13,210 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:22:13,210 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 152 treesize of output 1 [2022-07-12 03:22:13,214 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:22:13,214 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 229 treesize of output 1 [2022-07-12 03:22:13,215 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-12 03:22:13,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15852088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:22:13,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:22:13,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2022-07-12 03:22:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782703970] [2022-07-12 03:22:13,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:22:13,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 03:22:13,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:22:13,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 03:22:13,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=456, Unknown=10, NotChecked=90, Total=650 [2022-07-12 03:22:13,217 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-12 03:22:15,282 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse16 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse17 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.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 .cse17 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (.cse5 (= (select .cse17 .cse16) 0)) (.cse9 (= (select .cse15 .cse16) 0)) (.cse3 (+ |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|)) (forall ((v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (let ((.cse1 (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 .cse1 (select (select .cse1 |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)) (= (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))) .cse2 (= .cse3 4) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2397 Int) (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)) (forall ((v_ArrVal_2395 Int)) (= (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 |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse5 (forall ((v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2395 Int) (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)) (= (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_~bucket~0#1.offset| 0) (or (exists ((v_arrayElimCell_193 Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| v_arrayElimCell_193))) (let ((.cse8 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_193)) (.cse6 (select .cse7 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse6) 0) 0) (= (select .cse7 4) 0) (= (select .cse8 0) 0) (not (= v_arrayElimCell_193 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse8 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 0) 0) (= .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|))))) (and .cse0 .cse9 (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse14)) (.cse13 (select |c_#memory_$Pointer$.offset| .cse14))) (let ((.cse11 (= (select .cse13 0) 0)) (.cse10 (select .cse12 0))) (or (and (= .cse10 0) .cse2 .cse5 .cse11) (and (= 0 (select (select |c_#memory_$Pointer$.base| .cse10) 0)) .cse2 .cse5 (= (select .cse12 4) 0) .cse11 (= (select (select |c_#memory_$Pointer$.offset| .cse10) 0) 0) (= (select .cse13 4) 0))))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) .cse9 (forall ((v_ArrVal_2395 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2397 Int) (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)) (= (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 |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) (not (= .cse14 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|) .cse3) 0))))) is different from false [2022-07-12 03:22:16,159 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse15 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse16 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse0 (not (= .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (.cse2 (= (select .cse16 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (.cse4 (= (select .cse16 .cse15) 0)) (.cse8 (= (select .cse14 .cse15) 0))) (and .cse0 (forall ((v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2400 (Array Int Int))) (= (select (select (let ((.cse1 (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 .cse1 (select (select .cse1 |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)) (= (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))) .cse2 (forall ((|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2397 Int) (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)) (forall ((v_ArrVal_2395 Int)) (= (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 |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse4 (forall ((v_ArrVal_2397 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2395 Int) (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)) (= (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_~bucket~0#1.offset| 0) (or (exists ((v_arrayElimCell_193 Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| v_arrayElimCell_193))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_193)) (.cse5 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) 0) 0) (= (select .cse6 4) 0) (= (select .cse7 0) 0) (not (= v_arrayElimCell_193 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse7 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 0) 0) (= .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|))))) (and .cse0 .cse8 (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse13)) (.cse12 (select |c_#memory_$Pointer$.offset| .cse13))) (let ((.cse10 (= (select .cse12 0) 0)) (.cse9 (select .cse11 0))) (or (and (= .cse9 0) .cse2 .cse4 .cse10) (and (= 0 (select (select |c_#memory_$Pointer$.base| .cse9) 0)) .cse2 .cse4 (= (select .cse11 4) 0) .cse10 (= (select (select |c_#memory_$Pointer$.offset| .cse9) 0) 0) (= (select .cse12 4) 0))))))) .cse8 (forall ((v_ArrVal_2395 Int) (|v_ULTIMATE.start_main_~item~0#1.base_47| Int)) (or (forall ((v_ArrVal_2397 Int) (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)) (= (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))) (not (= .cse13 0)))))) is different from false [2022-07-12 03:22:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:22:17,030 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-07-12 03:22:17,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 03:22:17,031 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-12 03:22:17,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:22:17,031 INFO L225 Difference]: With dead ends: 125 [2022-07-12 03:22:17,031 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 03:22:17,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=187, Invalid=873, Unknown=12, NotChecked=260, Total=1332 [2022-07-12 03:22:17,032 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 76 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:22:17,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 382 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 138 Invalid, 0 Unknown, 246 Unchecked, 0.1s Time] [2022-07-12 03:22:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 03:22:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2022-07-12 03:22:17,041 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-12 03:22:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2022-07-12 03:22:17,042 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 27 [2022-07-12 03:22:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:22:17,042 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2022-07-12 03:22:17,042 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-12 03:22:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2022-07-12 03:22:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:22:17,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:22:17,043 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-12 03:22:17,078 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-12 03:22:17,260 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-12 03:22:17,260 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-12 03:22:17,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:22:17,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1921519731, now seen corresponding path program 1 times [2022-07-12 03:22:17,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:22:17,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417928925] [2022-07-12 03:22:17,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:22:17,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:22:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:22:17,591 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-12 03:22:17,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:22:17,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417928925] [2022-07-12 03:22:17,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417928925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:22:17,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434040622] [2022-07-12 03:22:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:22:17,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:22:17,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:22:17,598 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-12 03:22:17,599 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-12 03:22:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:22:17,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-12 03:22:17,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:22:17,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:17,803 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-12 03:22:17,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:17,848 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-12 03:22:17,878 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-12 03:22:17,879 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-12 03:22:17,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:17,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:17,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:17,884 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-12 03:22:17,888 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:22:17,888 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-12 03:22:17,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:17,925 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 03:22:17,925 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-12 03:22:17,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:17,940 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 03:22:17,940 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-12 03:22:17,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:17,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:22:17,998 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 03:22:17,999 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-12 03:22:18,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:18,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:22:18,010 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 03:22:18,010 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-12 03:22:18,319 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 03:22:18,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, 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-12 03:22:18,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:18,330 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 03:22:18,330 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-12 03:22:18,414 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-12 03:22:18,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:22:18,417 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-12 03:22:18,432 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-12 03:22:18,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:22:18,476 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-12 03:22:18,634 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2609 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse1 (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_2610)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= (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|) .cse0 v_ArrVal_2609)) .cse1 v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0) (= .cse1 0))))) (or (forall ((v_ArrVal_2609 Int)) (= (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|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_2609)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (forall ((v_ArrVal_2612 (Array Int Int)) (v_ArrVal_2610 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_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))) (forall ((v_ArrVal_2612 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse4 (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_2610)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse3 0) (= (select (select (store .cse4 .cse3 v_ArrVal_2612) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_2609 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse5 (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|) .cse6 v_ArrVal_2609)))) (or (= (select (select (store .cse5 (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|) .cse6 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) (= (select (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))))) is different from false [2022-07-12 03:22:18,716 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse0 (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)))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store .cse0 (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_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2612 (Array Int Int)) (v_ArrVal_2610 Int)) (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)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse1 0) (= (select (select (store .cse2 .cse1 v_ArrVal_2612) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse3 (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|))) (or (= (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)) .cse3 v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0) (= .cse3 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int)) (or (forall ((v_ArrVal_2609 Int)) (= (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)) (forall ((v_ArrVal_2612 (Array Int Int)) (v_ArrVal_2610 Int)) (= (select (select (let ((.cse4 (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 .cse4 (select (select .cse4 |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-12 03:22:18,755 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:22:18,756 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 157 treesize of output 1 [2022-07-12 03:22:18,759 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:22:18,763 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:22:18,763 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 104 treesize of output 1 [2022-07-12 03:22:18,768 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:22:18,768 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 157 treesize of output 1 [2022-07-12 03:22:18,769 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-12 03:22:18,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434040622] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:22:18,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:22:18,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2022-07-12 03:22:18,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049157963] [2022-07-12 03:22:18,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:22:18,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 03:22:18,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:22:18,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 03:22:18,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=466, Unknown=3, NotChecked=138, Total=702 [2022-07-12 03:22:18,771 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-12 03:22:18,867 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (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|)) (.cse13 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse0 (not (= .cse11 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (.cse2 (= (select .cse1 .cse13) 0)) (.cse4 (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse3 (= (select .cse12 .cse13) 0)) (.cse6 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and .cse0 (= (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) .cse2 (or (and .cse0 .cse2 .cse3) .cse4) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse5 (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)))) (or (= (select (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store .cse5 (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)))) (= |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) (or (not .cse4) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) .cse3 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse6) 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2612 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse8 (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)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse7 0) (= (select (select (store .cse8 .cse7 v_ArrVal_2612) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse9 (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|))) (or (= (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)) .cse9 v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0) (= .cse9 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int)) (or (forall ((v_ArrVal_2609 Int)) (= (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)) (forall ((v_ArrVal_2612 (Array Int Int)) (v_ArrVal_2610 Int)) (= (select (select (let ((.cse10 (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 .cse10 (select (select .cse10 |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_~item~0#1.base| 0) (not (= .cse11 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse6) 0))))) is different from false [2022-07-12 03:22:18,887 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|)) (.cse2 (+ |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) (= (select .cse1 .cse2) 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse3 (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)))) (or (= (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store .cse3 (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)))) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select .cse4 .cse2) 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2612 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse6 (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)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse5 0) (= (select (select (store .cse6 .cse5 v_ArrVal_2612) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2609 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2610 Int)) (let ((.cse7 (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|))) (or (= (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)) .cse7 v_ArrVal_2613) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0) (= .cse7 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int)) (or (forall ((v_ArrVal_2609 Int)) (= (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)) (forall ((v_ArrVal_2612 (Array Int Int)) (v_ArrVal_2610 Int)) (= (select (select (let ((.cse8 (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 .cse8 (select (select .cse8 |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)))) (not (= .cse0 0))))) is different from false [2022-07-12 03:22:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:22:20,454 INFO L93 Difference]: Finished difference Result 182 states and 220 transitions. [2022-07-12 03:22:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 03:22:20,455 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-12 03:22:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:22:20,456 INFO L225 Difference]: With dead ends: 182 [2022-07-12 03:22:20,456 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 03:22:20,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=241, Invalid=1179, Unknown=6, NotChecked=380, Total=1806 [2022-07-12 03:22:20,457 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 117 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:22:20,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 443 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 286 Invalid, 0 Unknown, 451 Unchecked, 0.2s Time] [2022-07-12 03:22:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 03:22:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 127. [2022-07-12 03:22:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 125 states have (on average 1.256) internal successors, (157), 126 states have internal predecessors, (157), 0 states have call successors, (0), 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-12 03:22:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2022-07-12 03:22:20,466 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 27 [2022-07-12 03:22:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:22:20,467 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2022-07-12 03:22:20,467 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-12 03:22:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2022-07-12 03:22:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:22:20,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:22:20,467 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-12 03:22:20,526 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-12 03:22:20,684 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-12 03:22:20,685 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-12 03:22:20,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:22:20,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1308386699, now seen corresponding path program 1 times [2022-07-12 03:22:20,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:22:20,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362768885] [2022-07-12 03:22:20,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:22:20,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:22:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:22:20,826 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-12 03:22:20,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:22:20,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362768885] [2022-07-12 03:22:20,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362768885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:22:20,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:22:20,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:22:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343894330] [2022-07-12 03:22:20,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:22:20,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:22:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:22:20,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:22:20,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:22:20,827 INFO L87 Difference]: Start difference. First operand 127 states and 157 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-12 03:22:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:22:20,952 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2022-07-12 03:22:20,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:22:20,953 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-12 03:22:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:22:20,953 INFO L225 Difference]: With dead ends: 175 [2022-07-12 03:22:20,953 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 03:22:20,954 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-12 03:22:20,962 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-12 03:22:20,963 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-12 03:22:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 03:22:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2022-07-12 03:22:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 125 states have (on average 1.248) internal successors, (156), 126 states have internal predecessors, (156), 0 states have call successors, (0), 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-12 03:22:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 156 transitions. [2022-07-12 03:22:20,976 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 156 transitions. Word has length 27 [2022-07-12 03:22:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:22:20,976 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 156 transitions. [2022-07-12 03:22:20,976 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-12 03:22:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 156 transitions. [2022-07-12 03:22:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:22:20,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:22:20,976 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-12 03:22:20,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 03:22:20,976 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-12 03:22:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:22:20,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1764820376, now seen corresponding path program 2 times [2022-07-12 03:22:20,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:22:20,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703959287] [2022-07-12 03:22:20,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:22:20,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:22:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:22:21,285 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-12 03:22:21,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:22:21,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703959287] [2022-07-12 03:22:21,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703959287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:22:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118689518] [2022-07-12 03:22:21,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:22:21,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:22:21,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:22:21,287 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-12 03:22:21,288 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-12 03:22:21,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:22:21,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:22:21,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-12 03:22:21,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:22:21,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:21,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:21,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:21,661 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-12 03:22:21,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:21,666 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-12 03:22:21,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:22:21,670 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-12 03:22:21,690 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-12 03:22:21,690 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-12 03:22:21,695 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-12 03:22:21,699 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-12 03:22:21,703 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-12 03:22:21,707 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-12 03:22:21,773 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:22:21,773 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-12 03:22:21,778 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-12 03:22:21,789 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:22:21,789 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-12 03:22:21,793 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-12 03:22:21,811 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-12 03:22:21,811 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-12 03:22:21,817 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-12 03:22:21,835 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:22:21,835 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-12 03:22:21,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, 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-12 03:22:21,900 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-12 03:22:21,905 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-12 03:22:22,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:22:22,029 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-12 03:22:22,162 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-12 03:22:22,162 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-12 03:22:22,173 INFO L356 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2022-07-12 03:22:22,173 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-12 03:22:22,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:22:22,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 70 [2022-07-12 03:22:22,298 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-12 03:22:22,308 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-12 03:22:22,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:22:31,978 WARN L833 $PredicateComparison]: unable to prove that (and (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))) (or (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|)))) (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)) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2930) |ULTIMATE.start_main_~bcki~0#1.base|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|)) 0)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_2930 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2930))) (let ((.cse1 (select .cse3 |ULTIMATE.start_main_~bcki~0#1.base|)) (.cse2 (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (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 .cse1 .cse2) 0)) (= (select (select (store .cse3 |ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse2 |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)))))) is different from false [2022-07-12 03:22:32,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:22:32,007 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-12 03:22:32,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:22:32,047 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-12 03:22:32,218 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:22:32,218 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-12 03:22:32,225 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:22:32,226 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-12 03:22:32,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118689518] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:22:32,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:22:32,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-07-12 03:22:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741021789] [2022-07-12 03:22:32,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:22:32,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 03:22:32,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:22:32,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 03:22:32,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=471, Unknown=5, NotChecked=44, Total=600 [2022-07-12 03:22:32,229 INFO L87 Difference]: Start difference. First operand 127 states and 156 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-12 03:22:32,412 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|)) (.cse2 (+ |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) (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))) (or (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|)))) (forall ((v_ArrVal_2933 Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2929))) (store .cse1 |ULTIMATE.start_main_~bcki~0#1.base| (store (select .cse1 |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)) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2930) |ULTIMATE.start_main_~bcki~0#1.base|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|)) 0)))) (= (select .cse0 .cse2) 0) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_2930 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.base| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2930))) (let ((.cse3 (select .cse5 |ULTIMATE.start_main_~bcki~0#1.base|)) (.cse4 (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (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 .cse3 .cse4) 0)) (= (select (select (store .cse5 |ULTIMATE.start_main_~bcki~0#1.base| (store .cse3 .cse4 |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))))) (= (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 .cse2) 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-12 03:23:13,768 WARN L233 SmtUtils]: Spent 8.80s on a formula simplification. DAG size of input: 51 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:23:43,989 WARN L233 SmtUtils]: Spent 9.52s on a formula simplification. DAG size of input: 46 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:23:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:23:44,078 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2022-07-12 03:23:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 03:23:44,079 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-12 03:23:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:23:44,080 INFO L225 Difference]: With dead ends: 162 [2022-07-12 03:23:44,080 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 03:23:44,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 81.4s TimeCoverageRelationStatistics Valid=299, Invalid=1238, Unknown=31, NotChecked=154, Total=1722 [2022-07-12 03:23:44,081 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 113 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:23:44,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 350 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 242 Invalid, 0 Unknown, 267 Unchecked, 0.3s Time] [2022-07-12 03:23:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 03:23:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2022-07-12 03:23:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.2520325203252032) internal successors, (154), 124 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-12 03:23:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2022-07-12 03:23:44,087 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 29 [2022-07-12 03:23:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:23:44,087 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2022-07-12 03:23:44,087 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-12 03:23:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2022-07-12 03:23:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:23:44,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:23:44,088 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-12 03:23:44,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 03:23:44,288 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-12 03:23:44,288 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-12 03:23:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:23:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1842471721, now seen corresponding path program 1 times [2022-07-12 03:23:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:23:44,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404679035] [2022-07-12 03:23:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:23:44,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:23:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:23:44,405 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-12 03:23:44,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:23:44,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404679035] [2022-07-12 03:23:44,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404679035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:23:44,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:23:44,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:23:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872060914] [2022-07-12 03:23:44,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:23:44,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:23:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:23:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:23:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:23:44,407 INFO L87 Difference]: Start difference. First operand 125 states and 154 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-12 03:23:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:23:44,556 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2022-07-12 03:23:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:23:44,557 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-12 03:23:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:23:44,557 INFO L225 Difference]: With dead ends: 160 [2022-07-12 03:23:44,557 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 03:23:44,558 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-12 03:23:44,558 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:23:44,558 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.1s Time] [2022-07-12 03:23:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 03:23:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 136. [2022-07-12 03:23:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 1.2462686567164178) internal successors, (167), 135 states have internal predecessors, (167), 0 states have call successors, (0), 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-12 03:23:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 167 transitions. [2022-07-12 03:23:44,566 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 167 transitions. Word has length 29 [2022-07-12 03:23:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:23:44,566 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 167 transitions. [2022-07-12 03:23:44,567 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-12 03:23:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2022-07-12 03:23:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:23:44,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:23:44,568 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-12 03:23:44,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 03:23:44,568 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-12 03:23:44,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:23:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash -461850395, now seen corresponding path program 1 times [2022-07-12 03:23:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:23:44,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138164107] [2022-07-12 03:23:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:23:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:23:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:23:44,734 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-12 03:23:44,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:23:44,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138164107] [2022-07-12 03:23:44,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138164107] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:23:44,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124294855] [2022-07-12 03:23:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:23:44,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:23:44,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:23:44,740 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-12 03:23:44,785 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-12 03:23:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:23:44,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-12 03:23:44,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:23:45,002 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-12 03:23:45,002 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-12 03:23:45,010 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-12 03:23:45,015 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:23:45,016 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-12 03:23:45,019 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-12 03:23:45,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:45,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 03:23:45,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:45,040 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-12 03:23:45,163 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-12 03:23:45,166 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-12 03:23:45,220 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-12 03:23:45,228 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 03:23:45,228 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-12 03:23:45,230 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-12 03:23:45,232 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-12 03:23:45,248 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-12 03:23:45,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:23:45,269 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-12 03:23:45,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:23:45,296 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-12 03:23:45,301 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-12 03:23:45,314 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-12 03:23:45,356 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-12 03:23:45,362 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-12 03:23:45,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:23:45,370 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-12 03:23:45,372 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-12 03:23:45,377 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:23:45,377 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-12 03:23:45,391 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-12 03:23:45,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124294855] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:23:45,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:23:45,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2022-07-12 03:23:45,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947106554] [2022-07-12 03:23:45,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:23:45,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 03:23:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:23:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 03:23:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=227, Unknown=5, NotChecked=170, Total=462 [2022-07-12 03:23:45,392 INFO L87 Difference]: Start difference. First operand 136 states and 167 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-12 03:23:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:23:46,207 INFO L93 Difference]: Finished difference Result 309 states and 380 transitions. [2022-07-12 03:23:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 03:23:46,208 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-12 03:23:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:23:46,209 INFO L225 Difference]: With dead ends: 309 [2022-07-12 03:23:46,209 INFO L226 Difference]: Without dead ends: 298 [2022-07-12 03:23:46,209 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-12 03:23:46,210 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 218 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 567 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:23:46,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 394 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 507 Invalid, 0 Unknown, 567 Unchecked, 0.5s Time] [2022-07-12 03:23:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-12 03:23:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 197. [2022-07-12 03:23:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 195 states have (on average 1.2666666666666666) internal successors, (247), 196 states have internal predecessors, (247), 0 states have call successors, (0), 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-12 03:23:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 247 transitions. [2022-07-12 03:23:46,220 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 247 transitions. Word has length 29 [2022-07-12 03:23:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:23:46,221 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 247 transitions. [2022-07-12 03:23:46,221 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-12 03:23:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 247 transitions. [2022-07-12 03:23:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:23:46,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:23:46,221 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-12 03:23:46,240 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-12 03:23:46,459 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-12 03:23:46,459 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-12 03:23:46,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:23:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -993211820, now seen corresponding path program 1 times [2022-07-12 03:23:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:23:46,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907070892] [2022-07-12 03:23:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:23:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:23:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:23:46,618 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-12 03:23:46,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:23:46,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907070892] [2022-07-12 03:23:46,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907070892] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:23:46,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774199109] [2022-07-12 03:23:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:23:46,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:23:46,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:23:46,632 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-12 03:23:46,633 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-12 03:23:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:23:46,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 123 conjunts are in the unsatisfiable core [2022-07-12 03:23:46,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:23:46,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,872 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-12 03:23:46,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,878 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-12 03:23:46,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,887 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-12 03:23:46,903 INFO L356 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-07-12 03:23:46,903 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-12 03:23:46,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,912 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-12 03:23:46,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:46,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 23 treesize of output 27 [2022-07-12 03:23:46,948 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-12 03:23:46,948 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-12 03:23:46,955 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-12 03:23:46,959 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-12 03:23:47,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:23:47,177 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-12 03:23:47,177 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-12 03:23:47,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,196 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-12 03:23:47,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,208 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 03:23:47,208 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-12 03:23:47,226 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-12 03:23:47,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 03:23:47,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:23:47,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:23:47,475 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-12 03:23:47,476 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-12 03:23:47,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:47,482 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-12 03:23:47,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:23:47,699 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-12 03:23:48,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:48,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:48,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:48,187 INFO L356 Elim1Store]: treesize reduction 182, result has 29.7 percent of original size [2022-07-12 03:23:48,187 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-12 03:23:48,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:23:48,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:23:48,250 INFO L356 Elim1Store]: treesize reduction 126, result has 35.7 percent of original size [2022-07-12 03:23:48,251 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-12 03:23:48,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:23:48,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 229 treesize of output 244 [2022-07-12 03:23:48,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:23:48,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 258 treesize of output 318 [2022-07-12 03:23:48,972 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-12 03:23:48,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:23:51,024 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-12 03:23:53,037 WARN L833 $PredicateComparison]: unable to prove that (and (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)))) (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)))) (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)))) (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))))) is different from false [2022-07-12 03:24:03,122 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:24:10,810 WARN L233 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:24:19,882 WARN L233 SmtUtils]: Spent 8.92s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:24:27,707 WARN L233 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:24:43,268 WARN L233 SmtUtils]: Spent 15.02s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:24:43,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:24:43,342 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-12 03:24:44,484 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:24:44,485 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 254 treesize of output 1 [2022-07-12 03:24:44,496 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:24:44,496 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 189 treesize of output 1 [2022-07-12 03:24:44,504 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:24:44,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 2 case distinctions, treesize of input 383 treesize of output 1 [2022-07-12 03:24:44,515 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 03:24:44,515 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 319 treesize of output 1 [2022-07-12 03:24:44,516 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-12 03:24:44,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774199109] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:24:44,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:24:44,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 29 [2022-07-12 03:24:44,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123808208] [2022-07-12 03:24:44,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:24:44,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 03:24:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 03:24:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=602, Unknown=2, NotChecked=102, Total=812 [2022-07-12 03:24:44,518 INFO L87 Difference]: Start difference. First operand 197 states and 247 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-12 03:24:46,714 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse10 (select .cse15 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse33 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse31 (select .cse33 0)) (.cse32 (select |c_#memory_$Pointer$.offset| .cse10)) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (= (select .cse12 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (.cse1 (= (select .cse33 4) 0)) (.cse2 (= (select .cse32 0) 0)) (.cse13 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse14 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse11 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0)) (.cse3 (not (= .cse31 .cse10))) (.cse4 (= (select .cse32 4) 0)) (.cse6 (not (= .cse31 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (.cse30 (+ |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|)) .cse0 (let ((.cse5 (not (= .cse10 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (exists ((|ULTIMATE.start_main_~item~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (exists ((v_arrayElimIndex_54 Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_54))) (let ((.cse8 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_54)) (.cse7 (select .cse9 0))) (and (not (= .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse8 0) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| v_arrayElimIndex_54)) (= (select .cse8 4) 0) (not (= .cse7 v_arrayElimIndex_54)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| v_arrayElimIndex_54)) (not (= v_arrayElimIndex_54 0)) (= (select .cse9 4) 0))))) (not (= |ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (and (not (= .cse10 |c_ULTIMATE.start_main_~bucket~0#1.base|)) .cse0 .cse1 (exists ((|ULTIMATE.start_main_~item~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))) .cse4 .cse5))) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse11 (= (select .cse12 .cse13) 0) .cse1 .cse2 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse14) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse15 .cse13) 0) (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|) .cse14) 1) (and (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int) (|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int) (v_ArrVal_3477 Int)) (let ((.cse16 (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)))) (or (= (select (select (store .cse16 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse16 |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 ((v_ArrVal_3473 Int)) (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (let ((.cse18 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse17 (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|) .cse18 v_ArrVal_3477)))) (select (select .cse17 (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|) .cse18 v_ArrVal_3473)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select .cse17 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 4))))))) (= (select (select .cse16 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int) (v_ArrVal_3479 Int) (v_ArrVal_3473 Int)) (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)))) (or (forall ((v_ArrVal_3477 Int)) (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (let ((.cse20 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse19 (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|) .cse20 v_ArrVal_3477)))) (select (select .cse19 (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|) .cse20 v_ArrVal_3473)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select .cse19 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 4))))))) (= (select (select .cse21 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= 0 (select (select (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)))))) (forall ((|ULTIMATE.start_main_~itr~0#1.base| Int) (v_ArrVal_3480 Int) (|v_ULTIMATE.start_main_~itr~0#1.offset_33| Int) (v_ArrVal_3477 Int)) (or (forall ((v_ArrVal_3473 Int)) (let ((.cse24 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse23 (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|) .cse24 v_ArrVal_3473)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (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|) .cse24 v_ArrVal_3477)))) (select (select .cse22 .cse23) (+ (select (select .cse22 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 4))))) (= .cse23 0))))) (= (select (select (let ((.cse25 (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 .cse25 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse25 |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_ULTIMATE.start_main_~itr~0#1.offset_33| Int) (v_ArrVal_3479 Int) (v_ArrVal_3473 Int)) (or (forall ((v_ArrVal_3477 Int)) (let ((.cse27 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse26 (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|) .cse27 v_ArrVal_3477)))) (let ((.cse28 (select (select .cse26 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (not (<= |v_ULTIMATE.start_main_~itr~0#1.offset_33| (select (select .cse26 (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|) .cse27 v_ArrVal_3473)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ .cse28 4)))) (= .cse28 0)))))) (= 0 (select (select (let ((.cse29 (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 .cse29 |ULTIMATE.start_main_~itr~0#1.base| (store (select .cse29 |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))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse30) 0) (or (and .cse11 (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0)) (and (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)))) (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)))) (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)))) (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)))))) (= (select |c_#valid| .cse10) 1) (not (= .cse10 |c_ULTIMATE.start_main_~item~0#1.base|)) .cse3 .cse4 (= |c_ULTIMATE.start_main_~item~0#1.base| 0) .cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse30) 0))))))) is different from false [2022-07-12 03:25:09,157 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse12 (select .cse8 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse12)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~bcki~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0)) (.cse7 (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)))) (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))))) (.cse11 (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)))) (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))))) (.cse5 (select |c_#memory_$Pointer$.offset| .cse12)) (.cse13 (select .cse4 0)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and (= (select .cse0 |c_ULTIMATE.start_main_~bcki~0#1.offset|) 0) (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) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) .cse2 (= (select .cse1 .cse3) 0) (= (select .cse4 4) 0) (= (select .cse5 0) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| .cse6) 4) 0) .cse7 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse8 .cse3) 0) (= (select .cse9 .cse10) 0) (or (and .cse2 (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0)) (and .cse7 .cse11)) (not (= .cse12 |c_ULTIMATE.start_main_~item~0#1.base|)) .cse11 (not (= .cse13 .cse12)) (= (select .cse5 4) 0) (not (= .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse0 .cse10) 0)))))) is different from false [2022-07-12 03:25:11,168 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |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|)) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (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)))) (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)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0) 0) (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)))) (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)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0) 0))) is different from false [2022-07-12 03:25:13,175 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) (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)))) (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)))) (= |c_ULTIMATE.start_main_#t~mem13#1.base| 0) (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)))) (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))))) is different from false [2022-07-12 03:25:15,182 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse7)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse8 (select .cse3 0)) (.cse6 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~bcki~0#1.offset| .cse0) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse0 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= (select .cse1 .cse2) 0) (= (select .cse3 4) 0) (= (select .cse4 0) 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) (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)))) (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)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse5 .cse2) 0) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse6) 0) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse7) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) 1) (not (= .cse7 |c_ULTIMATE.start_main_~item~0#1.base|)) (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)))) (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)))) (not (= .cse8 .cse7)) (exists ((|ULTIMATE.start_main_~item~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (= (select .cse4 4) 0) (not (= .cse8 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse6) 0)))))) is different from false [2022-07-12 03:25:17,186 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse9 (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse9))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse1 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0)) (.cse5 (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)))) (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))))) (.cse8 (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)))) (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))))) (.cse4 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse10 (select .cse3 0)) (.cse7 (+ |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 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) .cse1 (= (select .cse0 .cse2) 0) (= (select .cse3 4) 0) (= (select .cse4 0) 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) .cse5 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse6 .cse2) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse7) 0) (or (and .cse1 (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0)) (and .cse5 .cse8)) (not (= .cse9 |c_ULTIMATE.start_main_~item~0#1.base|)) .cse8 (not (= .cse10 .cse9)) (= (select .cse4 4) 0) (not (= .cse10 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse7) 0)))))) is different from false [2022-07-12 03:25:19,191 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse7)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse8 (select .cse3 0)) (.cse6 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~bcki~0#1.offset| .cse0) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse0 0) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= (select .cse1 .cse2) 0) (= (select .cse3 4) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (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)))) (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)))) (= (select .cse5 .cse2) 0) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse6) 0) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse7) (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)))) (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)))) (not (= .cse8 .cse7)) (exists ((|ULTIMATE.start_main_~item~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (= (select .cse4 4) 0) (not (= .cse8 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse6) 0)))))) is different from false [2022-07-12 03:25:21,197 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse6)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse7 (select .cse3 0))) (and (= |c_ULTIMATE.start_main_~bcki~0#1.offset| .cse0) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= .cse0 0) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= (select .cse1 .cse2) 0) (= |c_ULTIMATE.start_main_#t~mem13#1.offset| 0) (= (select .cse3 4) 0) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (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)))) (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)))) (= (select .cse5 .cse2) 0) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0)) (= |c_ULTIMATE.start_main_~bcki~0#1.base| .cse6) (= |c_ULTIMATE.start_main_#t~mem13#1.base| 0) (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)))) (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)))) (not (= .cse7 .cse6)) (exists ((|ULTIMATE.start_main_~item~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (= (select .cse4 4) 0) (not (= .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base|))))))) is different from false [2022-07-12 03:25:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:25:21,393 INFO L93 Difference]: Finished difference Result 303 states and 381 transitions. [2022-07-12 03:25:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 03:25:21,393 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 30 [2022-07-12 03:25:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:25:21,394 INFO L225 Difference]: With dead ends: 303 [2022-07-12 03:25:21,394 INFO L226 Difference]: Without dead ends: 213 [2022-07-12 03:25:21,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 92.0s TimeCoverageRelationStatistics Valid=203, Invalid=881, Unknown=12, NotChecked=710, Total=1806 [2022-07-12 03:25:21,397 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 118 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:25:21,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 366 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 226 Invalid, 0 Unknown, 392 Unchecked, 0.3s Time] [2022-07-12 03:25:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-12 03:25:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2022-07-12 03:25:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 204 states have (on average 1.2549019607843137) internal successors, (256), 205 states have internal predecessors, (256), 0 states have call successors, (0), 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-12 03:25:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 256 transitions. [2022-07-12 03:25:21,409 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 256 transitions. Word has length 30 [2022-07-12 03:25:21,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:25:21,409 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 256 transitions. [2022-07-12 03:25:21,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-12 03:25:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2022-07-12 03:25:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 03:25:21,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:25:21,410 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, 1, 1, 1] [2022-07-12 03:25:21,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 03:25:21,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:25:21,628 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-12 03:25:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:25:21,628 INFO L85 PathProgramCache]: Analyzing trace with hash -217147576, now seen corresponding path program 1 times [2022-07-12 03:25:21,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:25:21,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410548751] [2022-07-12 03:25:21,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:25:21,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:25:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:25:22,129 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-12 03:25:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:25:22,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410548751] [2022-07-12 03:25:22,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410548751] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:25:22,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741593512] [2022-07-12 03:25:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:25:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:25:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:25:22,132 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:25:22,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 03:25:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:25:22,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 137 conjunts are in the unsatisfiable core [2022-07-12 03:25:22,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:25:22,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 35 [2022-07-12 03:25:22,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,399 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-12 03:25:22,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,404 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 32 treesize of output 36 [2022-07-12 03:25:22,424 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-12 03:25:22,424 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 89 treesize of output 86 [2022-07-12 03:25:22,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,432 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 23 treesize of output 27 [2022-07-12 03:25:22,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,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, 4 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-12 03:25:22,460 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-12 03:25:22,461 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-12 03:25:22,467 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-12 03:25:22,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,566 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 51 treesize of output 38 [2022-07-12 03:25:22,580 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 03:25:22,580 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-12 03:25:22,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 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-12 03:25:22,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 16 treesize of output 18 [2022-07-12 03:25:22,670 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 23 treesize of output 22 [2022-07-12 03:25:22,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,680 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 59 treesize of output 49 [2022-07-12 03:25:22,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:22,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2022-07-12 03:25:23,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:23,438 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 103 [2022-07-12 03:25:23,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:23,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:23,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:25:23,449 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:25:23,449 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 1 case distinctions, treesize of input 91 treesize of output 74 [2022-07-12 03:25:23,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:23,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:25:23,487 INFO L356 Elim1Store]: treesize reduction 197, result has 15.1 percent of original size [2022-07-12 03:25:23,489 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 7 new quantified variables, introduced 14 case distinctions, treesize of input 184 treesize of output 158 [2022-07-12 03:25:23,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:23,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:25:23,654 INFO L356 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2022-07-12 03:25:23,654 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 101 [2022-07-12 03:25:23,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:23,668 INFO L356 Elim1Store]: treesize reduction 131, result has 7.7 percent of original size [2022-07-12 03:25:23,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 178 treesize of output 158 [2022-07-12 03:25:23,680 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:25:23,680 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 2 case distinctions, treesize of input 42 treesize of output 53 [2022-07-12 03:25:23,683 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-12 03:25:25,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:25,885 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 40 treesize of output 42 [2022-07-12 03:25:25,895 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-12 03:25:25,895 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 2 case distinctions, treesize of input 61 treesize of output 22 [2022-07-12 03:25:25,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:25,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:25:25,905 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-12 03:25:25,905 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 45 [2022-07-12 03:25:25,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2022-07-12 03:25:26,015 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-12 03:25:26,015 INFO L328 TraceCheckSpWp]: Computing backward predicates...