./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 3a877d22 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-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 10:45:15,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 10:45:15,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 10:45:15,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 10:45:15,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 10:45:15,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 10:45:15,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 10:45:15,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 10:45:15,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 10:45:15,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 10:45:15,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 10:45:15,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 10:45:15,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 10:45:15,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 10:45:15,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 10:45:15,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 10:45:15,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 10:45:15,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 10:45:15,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 10:45:15,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 10:45:15,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 10:45:15,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 10:45:15,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 10:45:15,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 10:45:15,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 10:45:15,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 10:45:15,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 10:45:15,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 10:45:15,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 10:45:15,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 10:45:15,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 10:45:15,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 10:45:15,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 10:45:15,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 10:45:15,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 10:45:15,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 10:45:15,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 10:45:15,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 10:45:15,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 10:45:15,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 10:45:15,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 10:45:15,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 10:45:15,654 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 10:45:15,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 10:45:15,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 10:45:15,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 10:45:15,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 10:45:15,657 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 10:45:15,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 10:45:15,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 10:45:15,658 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 10:45:15,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 10:45:15,658 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 10:45:15,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 10:45:15,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 10:45:15,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 10:45:15,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 10:45:15,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 10:45:15,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 10:45:15,660 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 10:45:15,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 10:45:15,660 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 10:45:15,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 10:45:15,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 10:45:15,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 10:45:15,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 10:45:15,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:45:15,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 10:45:15,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 10:45:15,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 10:45:15,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 10:45:15,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 10:45:15,664 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 10:45:15,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 10:45:15,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 10:45:15,665 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 10:45:15,665 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 [2021-12-15 10:45:15,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 10:45:15,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 10:45:15,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 10:45:15,905 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 10:45:15,905 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 10:45:15,906 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 [2021-12-15 10:45:15,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da854025d/ed98f4a027e749a8bb8c574e8fc948a6/FLAGa42b6a8e4 [2021-12-15 10:45:16,363 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 10:45:16,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-15 10:45:16,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da854025d/ed98f4a027e749a8bb8c574e8fc948a6/FLAGa42b6a8e4 [2021-12-15 10:45:16,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da854025d/ed98f4a027e749a8bb8c574e8fc948a6 [2021-12-15 10:45:16,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 10:45:16,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 10:45:16,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 10:45:16,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 10:45:16,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 10:45:16,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:45:16" (1/1) ... [2021-12-15 10:45:16,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ed8d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:16, skipping insertion in model container [2021-12-15 10:45:16,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:45:16" (1/1) ... [2021-12-15 10:45:16,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 10:45:16,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 10:45:17,014 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] [2021-12-15 10:45:17,018 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] [2021-12-15 10:45:17,020 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] [2021-12-15 10:45:17,027 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] [2021-12-15 10:45:17,028 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] [2021-12-15 10:45:17,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:45:17,041 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 10:45:17,094 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] [2021-12-15 10:45:17,095 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] [2021-12-15 10:45:17,096 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] [2021-12-15 10:45:17,098 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] [2021-12-15 10:45:17,102 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] [2021-12-15 10:45:17,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:45:17,126 INFO L208 MainTranslator]: Completed translation [2021-12-15 10:45:17,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17 WrapperNode [2021-12-15 10:45:17,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 10:45:17,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 10:45:17,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 10:45:17,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 10:45:17,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (1/1) ... [2021-12-15 10:45:17,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (1/1) ... [2021-12-15 10:45:17,165 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2021-12-15 10:45:17,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 10:45:17,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 10:45:17,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 10:45:17,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 10:45:17,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (1/1) ... [2021-12-15 10:45:17,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (1/1) ... [2021-12-15 10:45:17,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (1/1) ... [2021-12-15 10:45:17,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (1/1) ... [2021-12-15 10:45:17,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (1/1) ... [2021-12-15 10:45:17,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (1/1) ... [2021-12-15 10:45:17,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (1/1) ... [2021-12-15 10:45:17,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 10:45:17,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 10:45:17,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 10:45:17,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 10:45:17,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (1/1) ... [2021-12-15 10:45:17,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:45:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:17,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 10:45:17,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 10:45:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 10:45:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 10:45:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 10:45:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 10:45:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 10:45:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 10:45:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 10:45:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 10:45:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 10:45:17,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 10:45:17,346 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 10:45:17,348 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 10:45:17,668 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 10:45:17,674 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 10:45:17,675 INFO L301 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-15 10:45:17,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:45:17 BoogieIcfgContainer [2021-12-15 10:45:17,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 10:45:17,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 10:45:17,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 10:45:17,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 10:45:17,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:45:16" (1/3) ... [2021-12-15 10:45:17,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c11a4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:45:17, skipping insertion in model container [2021-12-15 10:45:17,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:45:17" (2/3) ... [2021-12-15 10:45:17,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c11a4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:45:17, skipping insertion in model container [2021-12-15 10:45:17,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:45:17" (3/3) ... [2021-12-15 10:45:17,686 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2021-12-15 10:45:17,691 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 10:45:17,691 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-12-15 10:45:17,728 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 10:45:17,734 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 10:45:17,734 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-15 10:45:17,746 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) [2021-12-15 10:45:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 10:45:17,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:17,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:17,764 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2021-12-15 10:45:17,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:17,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379298474] [2021-12-15 10:45:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:17,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:18,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:18,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379298474] [2021-12-15 10:45:18,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379298474] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:18,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:18,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:45:18,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616568467] [2021-12-15 10:45:18,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:18,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:45:18,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:45:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:45:18,082 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) [2021-12-15 10:45:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:18,175 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2021-12-15 10:45:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:45:18,178 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 [2021-12-15 10:45:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:18,186 INFO L225 Difference]: With dead ends: 112 [2021-12-15 10:45:18,186 INFO L226 Difference]: Without dead ends: 66 [2021-12-15 10:45:18,189 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:45:18,193 INFO L933 BasicCegarLoop]: 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 [2021-12-15 10:45:18,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 84 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:45:18,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-15 10:45:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2021-12-15 10:45:18,227 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) [2021-12-15 10:45:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2021-12-15 10:45:18,230 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2021-12-15 10:45:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:18,230 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2021-12-15 10:45:18,231 INFO L471 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) [2021-12-15 10:45:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2021-12-15 10:45:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-15 10:45:18,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:18,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:18,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 10:45:18,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2021-12-15 10:45:18,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:18,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553011057] [2021-12-15 10:45:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:18,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:18,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:18,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553011057] [2021-12-15 10:45:18,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553011057] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:18,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:18,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:45:18,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765738698] [2021-12-15 10:45:18,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:18,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:45:18,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:45:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:45:18,336 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) [2021-12-15 10:45:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:18,428 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2021-12-15 10:45:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:45:18,429 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 [2021-12-15 10:45:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:18,430 INFO L225 Difference]: With dead ends: 45 [2021-12-15 10:45:18,430 INFO L226 Difference]: Without dead ends: 43 [2021-12-15 10:45:18,431 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:45:18,434 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:18,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-15 10:45:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2021-12-15 10:45:18,444 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) [2021-12-15 10:45:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2021-12-15 10:45:18,446 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2021-12-15 10:45:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:18,447 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2021-12-15 10:45:18,450 INFO L471 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) [2021-12-15 10:45:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2021-12-15 10:45:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 10:45:18,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:18,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:18,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 10:45:18,452 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2021-12-15 10:45:18,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:18,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950603143] [2021-12-15 10:45:18,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:18,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:18,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:18,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950603143] [2021-12-15 10:45:18,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950603143] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:18,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:18,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 10:45:18,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151074699] [2021-12-15 10:45:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:18,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 10:45:18,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:18,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 10:45:18,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:45:18,703 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) [2021-12-15 10:45:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:18,835 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2021-12-15 10:45:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:45:18,835 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 [2021-12-15 10:45:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:18,840 INFO L225 Difference]: With dead ends: 60 [2021-12-15 10:45:18,840 INFO L226 Difference]: Without dead ends: 49 [2021-12-15 10:45:18,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 10:45:18,843 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:18,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 100 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-15 10:45:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2021-12-15 10:45:18,854 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) [2021-12-15 10:45:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-12-15 10:45:18,856 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2021-12-15 10:45:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:18,856 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-12-15 10:45:18,857 INFO L471 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) [2021-12-15 10:45:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-12-15 10:45:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 10:45:18,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:18,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:18,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 10:45:18,858 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2021-12-15 10:45:18,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:18,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264312809] [2021-12-15 10:45:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:18,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:18,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:18,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264312809] [2021-12-15 10:45:18,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264312809] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:18,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:45:18,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:45:18,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652921682] [2021-12-15 10:45:18,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:18,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:45:18,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:18,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:45:18,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:45:18,910 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) [2021-12-15 10:45:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:18,981 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2021-12-15 10:45:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:45:18,982 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 [2021-12-15 10:45:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:18,982 INFO L225 Difference]: With dead ends: 45 [2021-12-15 10:45:18,982 INFO L226 Difference]: Without dead ends: 43 [2021-12-15 10:45:18,983 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:45:18,984 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:18,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:45:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-15 10:45:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-12-15 10:45:18,990 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) [2021-12-15 10:45:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2021-12-15 10:45:18,990 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2021-12-15 10:45:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:18,991 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2021-12-15 10:45:18,991 INFO L471 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) [2021-12-15 10:45:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2021-12-15 10:45:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 10:45:18,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:18,992 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:18,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 10:45:18,992 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2021-12-15 10:45:18,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:18,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249784588] [2021-12-15 10:45:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:18,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:19,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:19,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249784588] [2021-12-15 10:45:19,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249784588] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:19,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914623733] [2021-12-15 10:45:19,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:19,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:19,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:19,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:45:19,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 10:45:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:19,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-15 10:45:19,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:19,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:19,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-15 10:45:19,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:19,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-15 10:45:19,490 INFO L354 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-15 10:45:19,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 74 [2021-12-15 10:45:19,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:19,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:19,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:19,502 INFO L388 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 [2021-12-15 10:45:19,514 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 10:45:19,515 INFO L388 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 [2021-12-15 10:45:19,530 INFO L388 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 [2021-12-15 10:45:19,539 INFO L388 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 [2021-12-15 10:45:19,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:19,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:19,791 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-12-15 10:45:19,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 62 [2021-12-15 10:45:19,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:19,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:19,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:19,805 INFO L388 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2021-12-15 10:45:19,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:19,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:19,970 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-15 10:45:19,970 INFO L388 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 52 [2021-12-15 10:45:19,984 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-15 10:45:19,984 INFO L388 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 [2021-12-15 10:45:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:20,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:20,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914623733] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:20,225 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:20,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-12-15 10:45:20,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718487796] [2021-12-15 10:45:20,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:20,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 10:45:20,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:20,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 10:45:20,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-15 10:45:20,227 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:20,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:20,517 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2021-12-15 10:45:20,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 10:45:20,518 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 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 [2021-12-15 10:45:20,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:20,518 INFO L225 Difference]: With dead ends: 64 [2021-12-15 10:45:20,518 INFO L226 Difference]: Without dead ends: 53 [2021-12-15 10:45:20,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-12-15 10:45:20,519 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 28 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:20,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 211 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 133 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2021-12-15 10:45:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-15 10:45:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2021-12-15 10:45:20,524 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) [2021-12-15 10:45:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2021-12-15 10:45:20,524 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2021-12-15 10:45:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:20,524 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2021-12-15 10:45:20,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2021-12-15 10:45:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 10:45:20,525 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:20,525 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:20,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 10:45:20,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:20,726 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:20,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2021-12-15 10:45:20,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:20,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088058327] [2021-12-15 10:45:20,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:20,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:20,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:20,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088058327] [2021-12-15 10:45:20,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088058327] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:20,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970113668] [2021-12-15 10:45:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:20,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:20,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:20,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:45:20,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 10:45:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:20,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-15 10:45:20,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:20,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:20,965 INFO L388 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 [2021-12-15 10:45:20,983 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-15 10:45:20,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 64 [2021-12-15 10:45:21,006 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-15 10:45:21,007 INFO L388 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 [2021-12-15 10:45:21,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:21,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-15 10:45:21,071 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-15 10:45:21,071 INFO L388 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 [2021-12-15 10:45:21,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2021-12-15 10:45:21,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-15 10:45:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:21,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:21,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2021-12-15 10:45:21,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_23| Int) (v_ArrVal_676 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_23|))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_23| v_ArrVal_676) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))))) is different from false [2021-12-15 10:45:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:21,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970113668] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:21,248 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:21,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-15 10:45:21,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618352119] [2021-12-15 10:45:21,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:21,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 10:45:21,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:21,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 10:45:21,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2021-12-15 10:45:21,250 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) [2021-12-15 10:45:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:21,682 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2021-12-15 10:45:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 10:45:21,683 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 [2021-12-15 10:45:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:21,684 INFO L225 Difference]: With dead ends: 126 [2021-12-15 10:45:21,684 INFO L226 Difference]: Without dead ends: 124 [2021-12-15 10:45:21,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=183, Unknown=2, NotChecked=62, Total=342 [2021-12-15 10:45:21,685 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 168 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:21,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 251 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 184 Invalid, 0 Unknown, 125 Unchecked, 0.3s Time] [2021-12-15 10:45:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-15 10:45:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 62. [2021-12-15 10:45:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2021-12-15 10:45:21,691 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 16 [2021-12-15 10:45:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:21,691 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2021-12-15 10:45:21,691 INFO L471 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) [2021-12-15 10:45:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2021-12-15 10:45:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 10:45:21,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:21,692 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:21,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 10:45:21,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-15 10:45:21,893 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:21,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2021-12-15 10:45:21,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:21,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789422227] [2021-12-15 10:45:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:21,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:22,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:22,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789422227] [2021-12-15 10:45:22,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789422227] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:22,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870416794] [2021-12-15 10:45:22,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:45:22,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:22,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:22,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:45:22,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 10:45:22,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:45:22,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:45:22,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-15 10:45:22,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:22,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:22,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:22,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:22,376 INFO L388 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 [2021-12-15 10:45:22,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:22,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:22,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:22,382 INFO L388 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 [2021-12-15 10:45:22,399 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-15 10:45:22,400 INFO L388 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 [2021-12-15 10:45:22,489 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 10:45:22,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-15 10:45:22,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 10:45:22,520 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-15 10:45:22,521 INFO L388 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 [2021-12-15 10:45:22,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 10:45:22,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2021-12-15 10:45:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 10:45:22,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 10:45:22,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870416794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:45:22,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 10:45:22,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-12-15 10:45:22,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110059737] [2021-12-15 10:45:22,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:45:22,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 10:45:22,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:22,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 10:45:22,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-15 10:45:22,679 INFO L87 Difference]: Start difference. First operand 62 states and 76 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) [2021-12-15 10:45:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:22,918 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2021-12-15 10:45:22,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 10:45:22,919 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 [2021-12-15 10:45:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:22,920 INFO L225 Difference]: With dead ends: 142 [2021-12-15 10:45:22,920 INFO L226 Difference]: Without dead ends: 107 [2021-12-15 10:45:22,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-12-15 10:45:22,921 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:22,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 142 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2021-12-15 10:45:22,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-15 10:45:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 70. [2021-12-15 10:45:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.25) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2021-12-15 10:45:22,929 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 18 [2021-12-15 10:45:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:22,929 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2021-12-15 10:45:22,930 INFO L471 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) [2021-12-15 10:45:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2021-12-15 10:45:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 10:45:22,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:22,931 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:22,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 10:45:23,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:23,144 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:23,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2021-12-15 10:45:23,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:23,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951041460] [2021-12-15 10:45:23,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:23,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:23,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:23,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951041460] [2021-12-15 10:45:23,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951041460] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:23,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636063808] [2021-12-15 10:45:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:23,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:23,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:23,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:45:23,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 10:45:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:23,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-15 10:45:23,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:23,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:23,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-15 10:45:23,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:23,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2021-12-15 10:45:23,454 INFO L354 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-15 10:45:23,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 75 [2021-12-15 10:45:23,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:23,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:23,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:23,463 INFO L388 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 30 treesize of output 32 [2021-12-15 10:45:23,488 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-15 10:45:23,488 INFO L388 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 [2021-12-15 10:45:23,499 INFO L388 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 [2021-12-15 10:45:23,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:23,585 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 10:45:23,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 55 [2021-12-15 10:45:23,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:23,600 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-15 10:45:23,600 INFO L388 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 [2021-12-15 10:45:23,614 INFO L388 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 23 [2021-12-15 10:45:23,697 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 10:45:23,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 53 [2021-12-15 10:45:23,709 INFO L388 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 23 [2021-12-15 10:45:23,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 10:45:23,936 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 10:45:23,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2021-12-15 10:45:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:23,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:24,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (not (= 0 (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1044))) (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_1043) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))))) is different from false [2021-12-15 10:45:24,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_25| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_25|))) (not (= 0 (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_25| v_ArrVal_1044))) (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_25| v_ArrVal_1043) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) is different from false [2021-12-15 10:45:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:24,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636063808] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:24,058 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:24,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2021-12-15 10:45:24,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820284916] [2021-12-15 10:45:24,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:24,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-15 10:45:24,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:24,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-15 10:45:24,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=195, Unknown=2, NotChecked=58, Total=306 [2021-12-15 10:45:24,060 INFO L87 Difference]: Start difference. First operand 70 states and 85 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) [2021-12-15 10:45:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:24,753 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2021-12-15 10:45:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 10:45:24,753 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 [2021-12-15 10:45:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:24,754 INFO L225 Difference]: With dead ends: 142 [2021-12-15 10:45:24,754 INFO L226 Difference]: Without dead ends: 140 [2021-12-15 10:45:24,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=500, Unknown=2, NotChecked=98, Total=756 [2021-12-15 10:45:24,755 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 184 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:24,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 237 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 293 Invalid, 0 Unknown, 206 Unchecked, 0.4s Time] [2021-12-15 10:45:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-15 10:45:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 95. [2021-12-15 10:45:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 94 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2021-12-15 10:45:24,763 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 19 [2021-12-15 10:45:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:24,764 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2021-12-15 10:45:24,764 INFO L471 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) [2021-12-15 10:45:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2021-12-15 10:45:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 10:45:24,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:24,765 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:24,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-15 10:45:24,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:24,976 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:24,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2021-12-15 10:45:24,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:24,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688321735] [2021-12-15 10:45:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:24,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:25,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:25,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688321735] [2021-12-15 10:45:25,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688321735] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:25,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934372688] [2021-12-15 10:45:25,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:45:25,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:25,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:25,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:45:25,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 10:45:25,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:45:25,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:45:25,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 75 conjunts are in the unsatisfiable core [2021-12-15 10:45:25,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:25,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:25,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2021-12-15 10:45:25,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:25,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2021-12-15 10:45:25,555 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-15 10:45:25,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 79 [2021-12-15 10:45:25,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:25,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:25,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:25,565 INFO L388 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 [2021-12-15 10:45:25,572 INFO L388 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 [2021-12-15 10:45:25,579 INFO L388 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 [2021-12-15 10:45:25,585 INFO L388 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 [2021-12-15 10:45:25,589 INFO L388 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 [2021-12-15 10:45:25,597 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-15 10:45:25,597 INFO L388 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 [2021-12-15 10:45:25,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:25,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:25,750 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 10:45:25,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 62 [2021-12-15 10:45:25,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:25,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:25,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:25,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2021-12-15 10:45:25,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:25,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:25,913 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 10:45:25,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 65 [2021-12-15 10:45:25,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:25,926 INFO L354 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2021-12-15 10:45:25,926 INFO L388 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 [2021-12-15 10:45:26,094 INFO L354 Elim1Store]: treesize reduction 61, result has 15.3 percent of original size [2021-12-15 10:45:26,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 136 treesize of output 78 [2021-12-15 10:45:26,109 INFO L354 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2021-12-15 10:45:26,109 INFO L388 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 39 treesize of output 27 [2021-12-15 10:45:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:26,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:28,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934372688] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:28,639 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:28,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2021-12-15 10:45:28,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210540408] [2021-12-15 10:45:28,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:28,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-15 10:45:28,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:28,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 10:45:28,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=280, Unknown=1, NotChecked=0, Total=342 [2021-12-15 10:45:28,642 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 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) [2021-12-15 10:45:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:28,864 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2021-12-15 10:45:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 10:45:28,865 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 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) Word has length 20 [2021-12-15 10:45:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:28,865 INFO L225 Difference]: With dead ends: 115 [2021-12-15 10:45:28,865 INFO L226 Difference]: Without dead ends: 104 [2021-12-15 10:45:28,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=100, Invalid=405, Unknown=1, NotChecked=0, Total=506 [2021-12-15 10:45:28,866 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:28,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 241 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2021-12-15 10:45:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-15 10:45:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2021-12-15 10:45:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 99 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2021-12-15 10:45:28,873 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 20 [2021-12-15 10:45:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:28,873 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2021-12-15 10:45:28,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 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) [2021-12-15 10:45:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2021-12-15 10:45:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 10:45:28,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:28,874 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:28,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 10:45:29,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:29,088 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:29,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash 220535656, now seen corresponding path program 2 times [2021-12-15 10:45:29,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:29,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444014454] [2021-12-15 10:45:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:29,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 10:45:29,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:29,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444014454] [2021-12-15 10:45:29,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444014454] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:29,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753898218] [2021-12-15 10:45:29,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:45:29,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:29,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:29,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:45:29,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 10:45:29,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:45:29,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:45:29,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-15 10:45:29,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:29,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:29,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2021-12-15 10:45:29,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:29,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2021-12-15 10:45:29,756 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-15 10:45:29,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 100 [2021-12-15 10:45:29,762 INFO L388 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 [2021-12-15 10:45:29,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:29,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:29,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:29,774 INFO L388 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 [2021-12-15 10:45:29,803 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-15 10:45:29,803 INFO L388 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 [2021-12-15 10:45:29,812 INFO L388 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 [2021-12-15 10:45:29,910 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 10:45:29,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2021-12-15 10:45:29,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:29,918 INFO L388 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 [2021-12-15 10:45:29,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:29,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2021-12-15 10:45:29,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:29,936 INFO L388 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 [2021-12-15 10:45:29,955 INFO L354 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-12-15 10:45:29,956 INFO L388 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 [2021-12-15 10:45:30,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2021-12-15 10:45:30,045 INFO L388 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 [2021-12-15 10:45:30,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 10:45:30,281 INFO L388 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 42 treesize of output 22 [2021-12-15 10:45:30,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2021-12-15 10:45:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 10:45:30,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:30,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (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|) (+ |ULTIMATE.start_main_~item~0#1.offset| 4) 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1453) |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_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8)) 1)) is different from false [2021-12-15 10:45:30,446 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:30,446 INFO L388 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 [2021-12-15 10:45:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 10:45:30,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753898218] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:30,554 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:30,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2021-12-15 10:45:30,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725057192] [2021-12-15 10:45:30,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:30,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-15 10:45:30,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:30,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-15 10:45:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=228, Unknown=1, NotChecked=30, Total=306 [2021-12-15 10:45:30,558 INFO L87 Difference]: Start difference. First operand 100 states and 123 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) [2021-12-15 10:45:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:30,970 INFO L93 Difference]: Finished difference Result 170 states and 211 transitions. [2021-12-15 10:45:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 10:45:30,970 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 [2021-12-15 10:45:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:30,971 INFO L225 Difference]: With dead ends: 170 [2021-12-15 10:45:30,971 INFO L226 Difference]: Without dead ends: 135 [2021-12-15 10:45:30,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=372, Unknown=1, NotChecked=40, Total=506 [2021-12-15 10:45:30,973 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 94 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:30,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 309 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 193 Invalid, 0 Unknown, 129 Unchecked, 0.3s Time] [2021-12-15 10:45:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-15 10:45:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 109. [2021-12-15 10:45:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2021-12-15 10:45:30,997 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 21 [2021-12-15 10:45:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:30,999 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2021-12-15 10:45:30,999 INFO L471 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) [2021-12-15 10:45:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2021-12-15 10:45:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 10:45:31,000 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:31,000 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:31,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 10:45:31,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:31,214 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:31,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:31,214 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2021-12-15 10:45:31,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:31,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321074592] [2021-12-15 10:45:31,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:31,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:31,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:31,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321074592] [2021-12-15 10:45:31,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321074592] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:31,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499321386] [2021-12-15 10:45:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:31,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:31,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:31,399 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:45:31,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 10:45:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:31,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-15 10:45:31,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:31,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-15 10:45:31,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2021-12-15 10:45:31,619 INFO L354 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-15 10:45:31,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 88 [2021-12-15 10:45:31,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,627 INFO L388 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 [2021-12-15 10:45:31,634 INFO L388 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 [2021-12-15 10:45:31,638 INFO L388 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2021-12-15 10:45:31,643 INFO L388 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 [2021-12-15 10:45:31,665 INFO L354 Elim1Store]: treesize reduction 124, result has 10.8 percent of original size [2021-12-15 10:45:31,666 INFO L388 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 83 treesize of output 70 [2021-12-15 10:45:31,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2021-12-15 10:45:31,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,782 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 10:45:31,782 INFO L388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 76 [2021-12-15 10:45:31,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,805 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-15 10:45:31,805 INFO L388 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 [2021-12-15 10:45:31,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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 [2021-12-15 10:45:31,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,945 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-15 10:45:31,945 INFO L388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 86 [2021-12-15 10:45:31,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:31,950 INFO L388 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 [2021-12-15 10:45:31,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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 [2021-12-15 10:45:32,496 INFO L354 Elim1Store]: treesize reduction 28, result has 22.2 percent of original size [2021-12-15 10:45:32,497 INFO L388 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 68 [2021-12-15 10:45:32,506 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-15 10:45:32,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 19 [2021-12-15 10:45:32,542 INFO L388 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 [2021-12-15 10:45:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:32,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:32,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1657 Int)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1656)) (.cse1 (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_1657)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse3 (select (select .cse4 |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|) .cse0 2)) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 8))))) 2)) is different from false [2021-12-15 10:45:32,681 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:32,681 INFO L388 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 81 treesize of output 85 [2021-12-15 10:45:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:32,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499321386] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:32,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:32,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2021-12-15 10:45:32,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520854499] [2021-12-15 10:45:32,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:32,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-15 10:45:32,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:32,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 10:45:32,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2021-12-15 10:45:32,830 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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) [2021-12-15 10:45:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:33,711 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2021-12-15 10:45:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 10:45:33,711 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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) Word has length 21 [2021-12-15 10:45:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:33,712 INFO L225 Difference]: With dead ends: 177 [2021-12-15 10:45:33,712 INFO L226 Difference]: Without dead ends: 142 [2021-12-15 10:45:33,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=585, Unknown=1, NotChecked=50, Total=756 [2021-12-15 10:45:33,713 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 107 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:33,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 362 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 474 Invalid, 0 Unknown, 189 Unchecked, 0.6s Time] [2021-12-15 10:45:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-15 10:45:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2021-12-15 10:45:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 110 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2021-12-15 10:45:33,719 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 21 [2021-12-15 10:45:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:33,720 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2021-12-15 10:45:33,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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) [2021-12-15 10:45:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2021-12-15 10:45:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 10:45:33,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:33,721 INFO L514 BasicCegarLoop]: 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] [2021-12-15 10:45:33,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 10:45:33,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:33,936 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:33,936 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2021-12-15 10:45:33,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:33,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75923325] [2021-12-15 10:45:33,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:33,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:34,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:34,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75923325] [2021-12-15 10:45:34,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75923325] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:34,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031923583] [2021-12-15 10:45:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:34,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:34,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:34,238 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:45:34,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 10:45:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:34,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-15 10:45:34,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:34,467 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-12-15 10:45:34,468 INFO L388 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 27 [2021-12-15 10:45:34,493 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 10:45:34,493 INFO L388 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 [2021-12-15 10:45:34,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 10:45:34,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 10:45:34,670 INFO L388 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 [2021-12-15 10:45:34,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 10:45:34,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-15 10:45:34,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:34,750 INFO L388 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 [2021-12-15 10:45:34,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-15 10:45:34,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-12-15 10:45:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:34,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:34,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 178 [2021-12-15 10:45:34,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 318 [2021-12-15 10:45:45,709 INFO L354 Elim1Store]: treesize reduction 35, result has 37.5 percent of original size [2021-12-15 10:45:45,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 104 [2021-12-15 10:45:45,718 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 10:45:45,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 96 [2021-12-15 10:45:45,728 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-15 10:45:45,728 INFO L388 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 124 treesize of output 104 [2021-12-15 10:45:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:45,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031923583] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:45,804 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:45,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2021-12-15 10:45:45,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182771675] [2021-12-15 10:45:45,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:45,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-15 10:45:45,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:45,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-15 10:45:45,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=468, Unknown=3, NotChecked=0, Total=552 [2021-12-15 10:45:45,805 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:46,539 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2021-12-15 10:45:46,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 10:45:46,539 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 10:45:46,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:46,540 INFO L225 Difference]: With dead ends: 154 [2021-12-15 10:45:46,540 INFO L226 Difference]: Without dead ends: 152 [2021-12-15 10:45:46,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=179, Invalid=810, Unknown=3, NotChecked=0, Total=992 [2021-12-15 10:45:46,541 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 148 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:46,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 382 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 407 Invalid, 0 Unknown, 152 Unchecked, 0.5s Time] [2021-12-15 10:45:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-15 10:45:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 124. [2021-12-15 10:45:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 123 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2021-12-15 10:45:46,548 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 24 [2021-12-15 10:45:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:46,548 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2021-12-15 10:45:46,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2021-12-15 10:45:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 10:45:46,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:46,549 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:45:46,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-15 10:45:46,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-15 10:45:46,750 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:46,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1317906679, now seen corresponding path program 3 times [2021-12-15 10:45:46,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:46,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94120243] [2021-12-15 10:45:46,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:46,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:47,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:47,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94120243] [2021-12-15 10:45:47,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94120243] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:47,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003118740] [2021-12-15 10:45:47,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 10:45:47,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:47,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:47,029 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) [2021-12-15 10:45:47,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 10:45:48,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 10:45:48,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:45:48,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-15 10:45:48,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:48,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2021-12-15 10:45:48,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2021-12-15 10:45:48,273 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-15 10:45:48,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 79 [2021-12-15 10:45:48,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,280 INFO L388 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 [2021-12-15 10:45:48,288 INFO L388 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 [2021-12-15 10:45:48,295 INFO L388 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 [2021-12-15 10:45:48,301 INFO L388 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 [2021-12-15 10:45:48,307 INFO L388 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 [2021-12-15 10:45:48,315 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-15 10:45:48,315 INFO L388 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 [2021-12-15 10:45:48,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:48,445 INFO L354 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-12-15 10:45:48,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 105 treesize of output 79 [2021-12-15 10:45:48,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,450 INFO L388 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 58 treesize of output 66 [2021-12-15 10:45:48,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,622 INFO L354 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2021-12-15 10:45:48,622 INFO L388 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 [2021-12-15 10:45:48,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:48,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,632 INFO L354 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2021-12-15 10:45:48,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 101 treesize of output 68 [2021-12-15 10:45:48,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,803 INFO L354 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2021-12-15 10:45:48,803 INFO L388 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 58 treesize of output 55 [2021-12-15 10:45:48,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:48,811 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-15 10:45:48,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 65 [2021-12-15 10:45:48,920 INFO L354 Elim1Store]: treesize reduction 49, result has 14.0 percent of original size [2021-12-15 10:45:48,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 60 [2021-12-15 10:45:48,926 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 10:45:48,926 INFO L388 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 33 treesize of output 19 [2021-12-15 10:45:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:48,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:56,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003118740] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:45:56,495 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:45:56,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2021-12-15 10:45:56,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175672321] [2021-12-15 10:45:56,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:45:56,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 10:45:56,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:45:56,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 10:45:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=312, Unknown=3, NotChecked=0, Total=380 [2021-12-15 10:45:56,496 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:45:56,760 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2021-12-15 10:45:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 10:45:56,760 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 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 [2021-12-15 10:45:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:45:56,761 INFO L225 Difference]: With dead ends: 139 [2021-12-15 10:45:56,761 INFO L226 Difference]: Without dead ends: 111 [2021-12-15 10:45:56,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=81, Invalid=378, Unknown=3, NotChecked=0, Total=462 [2021-12-15 10:45:56,762 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:45:56,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 257 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2021-12-15 10:45:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-15 10:45:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-15 10:45:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 109 states have (on average 1.275229357798165) internal successors, (139), 110 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2021-12-15 10:45:56,768 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 25 [2021-12-15 10:45:56,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:45:56,768 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2021-12-15 10:45:56,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:45:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2021-12-15 10:45:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 10:45:56,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:45:56,769 INFO L514 BasicCegarLoop]: 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] [2021-12-15 10:45:56,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-15 10:45:56,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-15 10:45:56,979 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:45:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:45:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2021-12-15 10:45:56,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:45:56,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972616612] [2021-12-15 10:45:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:56,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:45:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:57,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:45:57,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972616612] [2021-12-15 10:45:57,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972616612] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:45:57,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585373780] [2021-12-15 10:45:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:45:57,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:45:57,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:45:57,146 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) [2021-12-15 10:45:57,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 10:45:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:45:57,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 75 conjunts are in the unsatisfiable core [2021-12-15 10:45:57,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:45:57,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:57,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-15 10:45:57,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:57,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2021-12-15 10:45:57,383 INFO L354 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2021-12-15 10:45:57,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 69 [2021-12-15 10:45:57,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:57,411 INFO L354 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2021-12-15 10:45:57,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 46 [2021-12-15 10:45:57,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-12-15 10:45:57,432 INFO L388 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 [2021-12-15 10:45:57,439 INFO L388 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 [2021-12-15 10:45:57,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:57,534 INFO L388 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 [2021-12-15 10:45:57,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:57,547 INFO L388 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 14 treesize of output 8 [2021-12-15 10:45:57,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:57,707 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-12-15 10:45:57,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 58 [2021-12-15 10:45:57,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:57,735 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-12-15 10:45:57,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 45 [2021-12-15 10:45:57,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:57,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:57,991 INFO L354 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2021-12-15 10:45:57,991 INFO L388 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 67 [2021-12-15 10:45:58,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:58,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:45:58,015 INFO L354 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2021-12-15 10:45:58,015 INFO L388 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 59 [2021-12-15 10:45:59,133 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-15 10:45:59,134 INFO L388 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 [2021-12-15 10:45:59,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:45:59,150 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 10:45:59,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 45 [2021-12-15 10:45:59,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 10:45:59,299 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:45:59,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2021-12-15 10:45:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:45:59,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:45:59,358 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2307 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2307) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2306 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2306) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2021-12-15 10:45:59,437 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2307 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_2307) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2306 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_2306) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) 0))) is different from false [2021-12-15 10:46:01,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2304 Int) (v_ArrVal_2303 Int)) (or (and (= (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_2303)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (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_2304)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2307 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2304)) (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_2303)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2307) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2306 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2303)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2306)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2021-12-15 10:46:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-15 10:46:01,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585373780] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:46:01,894 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:46:01,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 22 [2021-12-15 10:46:01,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187877333] [2021-12-15 10:46:01,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:46:01,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-15 10:46:01,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:46:01,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-15 10:46:01,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=277, Unknown=7, NotChecked=108, Total=462 [2021-12-15 10:46:01,896 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:46:03,996 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~bcki~0#1.base| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_main_~bucket~0#1.base| |ULTIMATE.start_main_~bcki~0#1.base|))) (and (or (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse0 .cse1) 0))) .cse2) (or (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (and (= (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select .cse3 .cse1) 0))) .cse2) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~bcki~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~bcki~0#1.base|) 0) 0)))) (= (select .cse4 .cse5) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse6) 0) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~item~0#1.base|) (= (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_2304 Int) (v_ArrVal_2303 Int)) (or (and (= (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_2303)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (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_2304)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2307 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2304)) (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_2303)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2307) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2306 (Array Int Int))) (= (select (select (let ((.cse7 (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_2303)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2306)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5) 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= 0 |c_ULTIMATE.start_main_~item~0#1.offset|))) is different from false [2021-12-15 10:46:06,006 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2304 Int) (v_ArrVal_2303 Int)) (or (and (= (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_2303)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (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_2304)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2307 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2304)) (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_2303)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2307) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2306 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2303)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2306)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (= 0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1) 0) (exists ((|ULTIMATE.start_main_~bcki~0#1.base| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse4 (= |c_ULTIMATE.start_main_~bucket~0#1.base| |ULTIMATE.start_main_~bcki~0#1.base|))) (and (or (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (and (not (= (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.offset|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse2 .cse3) 0))) .cse4) (or (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (and (= (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select .cse5 .cse3) 0))) .cse4) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~bcki~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~bcki~0#1.base|) 0) 0)))) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select .cse6 .cse1) 0))) is different from false [2021-12-15 10:46:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:46:07,990 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2021-12-15 10:46:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 10:46:07,990 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 10:46:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:46:07,991 INFO L225 Difference]: With dead ends: 147 [2021-12-15 10:46:07,991 INFO L226 Difference]: Without dead ends: 136 [2021-12-15 10:46:07,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=144, Invalid=569, Unknown=9, NotChecked=270, Total=992 [2021-12-15 10:46:07,992 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 66 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:46:07,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 393 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 241 Unchecked, 0.2s Time] [2021-12-15 10:46:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-15 10:46:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2021-12-15 10:46:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.2666666666666666) internal successors, (152), 121 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:46:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2021-12-15 10:46:07,999 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 27 [2021-12-15 10:46:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:46:07,999 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2021-12-15 10:46:07,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:46:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2021-12-15 10:46:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 10:46:08,000 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:46:08,000 INFO L514 BasicCegarLoop]: 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] [2021-12-15 10:46:08,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 10:46:08,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-15 10:46:08,211 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:46:08,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:46:08,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1921519731, now seen corresponding path program 1 times [2021-12-15 10:46:08,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:46:08,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049562480] [2021-12-15 10:46:08,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:46:08,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:46:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:46:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:46:08,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:46:08,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049562480] [2021-12-15 10:46:08,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049562480] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:46:08,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623456701] [2021-12-15 10:46:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:46:08,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:46:08,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:46:08,604 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) [2021-12-15 10:46:08,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 10:46:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:46:08,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-15 10:46:08,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:46:08,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:08,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2021-12-15 10:46:08,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:08,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2021-12-15 10:46:08,830 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-15 10:46:08,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 62 [2021-12-15 10:46:08,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:08,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:08,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:08,837 INFO L388 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 [2021-12-15 10:46:08,843 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 10:46:08,843 INFO L388 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 [2021-12-15 10:46:08,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:08,900 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-15 10:46:08,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2021-12-15 10:46:08,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:08,930 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-15 10:46:08,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 10:46:08,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:08,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:46:09,000 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-15 10:46:09,000 INFO L388 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 [2021-12-15 10:46:09,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:09,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:46:09,016 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-15 10:46:09,017 INFO L388 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 [2021-12-15 10:46:10,347 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-15 10:46:10,347 INFO L388 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 [2021-12-15 10:46:10,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:10,358 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 10:46:10,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 45 [2021-12-15 10:46:10,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 10:46:10,478 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:46:10,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2021-12-15 10:46:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:46:10,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:46:10,536 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2523 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2523) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2524 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2524) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2021-12-15 10:46:10,612 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2523 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_2523) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2524 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_2524) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) 0))) is different from false [2021-12-15 10:46:11,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (|v_ULTIMATE.start_main_~item~0#1.base_56| Int) (v_ArrVal_2520 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2520)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2519)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2524 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2520)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2519)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2524) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2523 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2519)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2523)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2021-12-15 10:46:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-15 10:46:11,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623456701] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:46:11,093 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:46:11,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2021-12-15 10:46:11,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279531399] [2021-12-15 10:46:11,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:46:11,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-15 10:46:11,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:46:11,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-15 10:46:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=345, Unknown=8, NotChecked=120, Total=552 [2021-12-15 10:46:11,095 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:46:13,237 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4)) (.cse5 (= (select .cse0 .cse8) 0)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse3 (= (select .cse7 .cse8) 0)) (.cse6 (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 1)) (not (= .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (<= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse2) 0) .cse3 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse2) 0) (= 0 |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_2519 Int) (|v_ULTIMATE.start_main_~item~0#1.base_56| Int) (v_ArrVal_2520 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2520)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2519)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2524 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2520)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2519)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2524) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2523 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2519)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2523)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (= 0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) .cse5 (or (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~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)) (not .cse6)) (= 0 |c_ULTIMATE.start_main_~item~0#1.offset|) (or (and .cse5 (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| .cse1)) .cse3) .cse6)))) is different from false [2021-12-15 10:46:13,263 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (= (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (forall ((v_ArrVal_2519 Int) (|v_ULTIMATE.start_main_~item~0#1.base_56| Int) (v_ArrVal_2520 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2520)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2519)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2524 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2520)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2519)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2524) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2523 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_56|) 0 0) 4 v_ArrVal_2519)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2523)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (= 0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) (= (select .cse0 .cse2) 0) (not (= (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.offset|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse3 .cse2) 0))) is different from false [2021-12-15 10:46:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:46:20,751 INFO L93 Difference]: Finished difference Result 198 states and 245 transitions. [2021-12-15 10:46:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-15 10:46:20,751 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 10:46:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:46:20,752 INFO L225 Difference]: With dead ends: 198 [2021-12-15 10:46:20,752 INFO L226 Difference]: Without dead ends: 187 [2021-12-15 10:46:20,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=221, Invalid=979, Unknown=10, NotChecked=350, Total=1560 [2021-12-15 10:46:20,753 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 108 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:46:20,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 344 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 253 Invalid, 0 Unknown, 397 Unchecked, 0.3s Time] [2021-12-15 10:46:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-15 10:46:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 150. [2021-12-15 10:46:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 149 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:46:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions. [2021-12-15 10:46:20,762 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 27 [2021-12-15 10:46:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:46:20,762 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions. [2021-12-15 10:46:20,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:46:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2021-12-15 10:46:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 10:46:20,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:46:20,763 INFO L514 BasicCegarLoop]: 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] [2021-12-15 10:46:20,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 10:46:20,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-15 10:46:20,979 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:46:20,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:46:20,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1308386699, now seen corresponding path program 1 times [2021-12-15 10:46:20,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:46:20,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443576527] [2021-12-15 10:46:20,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:46:20,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:46:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:46:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:46:21,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:46:21,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443576527] [2021-12-15 10:46:21,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443576527] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:46:21,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:46:21,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 10:46:21,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204741923] [2021-12-15 10:46:21,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:46:21,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 10:46:21,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:46:21,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 10:46:21,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 10:46:21,121 INFO L87 Difference]: Start difference. First operand 150 states and 190 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) [2021-12-15 10:46:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:46:21,305 INFO L93 Difference]: Finished difference Result 208 states and 263 transitions. [2021-12-15 10:46:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 10:46:21,306 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 [2021-12-15 10:46:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:46:21,307 INFO L225 Difference]: With dead ends: 208 [2021-12-15 10:46:21,307 INFO L226 Difference]: Without dead ends: 163 [2021-12-15 10:46:21,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-15 10:46:21,308 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:46:21,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 99 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:46:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-15 10:46:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2021-12-15 10:46:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 148 states have (on average 1.277027027027027) internal successors, (189), 149 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:46:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 189 transitions. [2021-12-15 10:46:21,316 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 189 transitions. Word has length 27 [2021-12-15 10:46:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:46:21,316 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 189 transitions. [2021-12-15 10:46:21,317 INFO L471 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) [2021-12-15 10:46:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2021-12-15 10:46:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 10:46:21,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:46:21,317 INFO L514 BasicCegarLoop]: 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] [2021-12-15 10:46:21,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 10:46:21,318 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-15 10:46:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:46:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1764820376, now seen corresponding path program 2 times [2021-12-15 10:46:21,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:46:21,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972198324] [2021-12-15 10:46:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:46:21,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:46:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:46:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:46:21,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:46:21,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972198324] [2021-12-15 10:46:21,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972198324] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:46:21,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234867657] [2021-12-15 10:46:21,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:46:21,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:46:21,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:46:21,604 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) [2021-12-15 10:46:21,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 10:46:22,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:46:22,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:46:22,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-15 10:46:22,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:46:22,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,054 INFO L388 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 [2021-12-15 10:46:22,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2021-12-15 10:46:22,066 INFO L388 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 [2021-12-15 10:46:22,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2021-12-15 10:46:22,095 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-15 10:46:22,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 93 [2021-12-15 10:46:22,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,105 INFO L388 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 [2021-12-15 10:46:22,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,114 INFO L388 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 [2021-12-15 10:46:22,145 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-15 10:46:22,146 INFO L388 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 [2021-12-15 10:46:22,152 INFO L388 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 [2021-12-15 10:46:22,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2021-12-15 10:46:22,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:46:22,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2021-12-15 10:46:22,276 INFO L354 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-12-15 10:46:22,276 INFO L388 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 [2021-12-15 10:46:22,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 10:46:22,370 INFO L388 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 51 treesize of output 45 [2021-12-15 10:46:22,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2021-12-15 10:46:22,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-15 10:46:22,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:46:22,982 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:46:22,982 INFO L388 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 2 case distinctions, treesize of input 49 treesize of output 49 [2021-12-15 10:46:23,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2021-12-15 10:46:23,189 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-12-15 10:46:23,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 59 [2021-12-15 10:46:23,402 INFO L388 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 50 treesize of output 30 [2021-12-15 10:46:23,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2021-12-15 10:46:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:46:23,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:46:23,503 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2845 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2844 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2021-12-15 10:46:23,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.base| Int)) (or (not (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (select (select |c_#memory_int| |ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)))) (and (forall ((v_ArrVal_2845 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2845) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2844 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2844) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2021-12-15 10:46:23,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.base_81| Int)) (or (not (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (select (select |c_#memory_int| |v_ULTIMATE.start_main_~bcki~0#1.base_81|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) 8)))) (and (forall ((v_ArrVal_2844 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~bcki~0#1.base_81| v_ArrVal_2844) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2845 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~bcki~0#1.base_81| v_ArrVal_2845) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false