./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/process_queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/heap-data/process_queue.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 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:18:51,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:18:51,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:18:51,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:18:51,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:18:51,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:18:51,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:18:51,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:18:51,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:18:51,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:18:51,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:18:51,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:18:51,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:18:51,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:18:51,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:18:51,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:18:51,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:18:51,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:18:51,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:18:51,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:18:51,456 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:18:51,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:18:51,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:18:51,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:18:51,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:18:51,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:18:51,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:18:51,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:18:51,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:18:51,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:18:51,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:18:51,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:18:51,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:18:51,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:18:51,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:18:51,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:18:51,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:18:51,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:18:51,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:18:51,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:18:51,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:18:51,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:18:51,473 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:18:51,495 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:18:51,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:18:51,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:18:51,496 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:18:51,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:18:51,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:18:51,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:18:51,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:18:51,498 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:18:51,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:18:51,499 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:18:51,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:18:51,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:18:51,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:18:51,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:18:51,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:18:51,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:18:51,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:18:51,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:18:51,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:18:51,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:18:51,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:18:51,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:18:51,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:18:51,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:18:51,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:18:51,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:18:51,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:18:51,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:18:51,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:18:51,502 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:18:51,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:18:51,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:18:51,503 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 -> 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c [2022-07-13 15:18:51,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:18:51,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:18:51,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:18:51,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:18:51,701 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:18:51,702 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/process_queue.i [2022-07-13 15:18:51,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410da11c2/93ae4e0052944d14a4e1cae8ba80bdd2/FLAGb43f9aedb [2022-07-13 15:18:52,181 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:18:52,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/process_queue.i [2022-07-13 15:18:52,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410da11c2/93ae4e0052944d14a4e1cae8ba80bdd2/FLAGb43f9aedb [2022-07-13 15:18:52,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410da11c2/93ae4e0052944d14a4e1cae8ba80bdd2 [2022-07-13 15:18:52,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:18:52,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:18:52,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:18:52,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:18:52,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:18:52,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32916b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52, skipping insertion in model container [2022-07-13 15:18:52,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:18:52,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:18:52,494 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/heap-data/process_queue.i[23979,23992] [2022-07-13 15:18:52,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:18:52,511 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:18:52,543 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/heap-data/process_queue.i[23979,23992] [2022-07-13 15:18:52,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:18:52,573 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:18:52,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52 WrapperNode [2022-07-13 15:18:52,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:18:52,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:18:52,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:18:52,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:18:52,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,615 INFO L137 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2022-07-13 15:18:52,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:18:52,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:18:52,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:18:52,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:18:52,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:18:52,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:18:52,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:18:52,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:18:52,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (1/1) ... [2022-07-13 15:18:52,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:18:52,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:52,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:18:52,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:18:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:18:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:18:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:18:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:18:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:18:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:18:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:18:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:18:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:18:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:18:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:18:52,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:18:52,797 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:18:52,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:18:52,955 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:18:52,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:18:52,959 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 15:18:52,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:18:52 BoogieIcfgContainer [2022-07-13 15:18:52,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:18:52,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:18:52,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:18:52,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:18:52,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:18:52" (1/3) ... [2022-07-13 15:18:52,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea95ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:18:52, skipping insertion in model container [2022-07-13 15:18:52,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:52" (2/3) ... [2022-07-13 15:18:52,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea95ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:18:52, skipping insertion in model container [2022-07-13 15:18:52,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:18:52" (3/3) ... [2022-07-13 15:18:52,966 INFO L111 eAbstractionObserver]: Analyzing ICFG process_queue.i [2022-07-13 15:18:52,976 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:18:52,976 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:18:53,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:18:53,012 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27e17535, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20816f45 [2022-07-13 15:18:53,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:18:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 15:18:53,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:53,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:53,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2060272908, now seen corresponding path program 1 times [2022-07-13 15:18:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:53,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872814450] [2022-07-13 15:18:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:53,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:53,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:53,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872814450] [2022-07-13 15:18:53,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872814450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:53,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:53,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:18:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274781652] [2022-07-13 15:18:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:53,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:18:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:53,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:18:53,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:18:53,191 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:53,213 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-07-13 15:18:53,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:18:53,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 15:18:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:53,221 INFO L225 Difference]: With dead ends: 51 [2022-07-13 15:18:53,221 INFO L226 Difference]: Without dead ends: 23 [2022-07-13 15:18:53,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:18:53,225 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:53,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:18:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-13 15:18:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-13 15:18:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-07-13 15:18:53,245 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-07-13 15:18:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:53,245 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-13 15:18:53,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-07-13 15:18:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 15:18:53,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:53,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:53,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:18:53,247 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1911586027, now seen corresponding path program 1 times [2022-07-13 15:18:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:53,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393956259] [2022-07-13 15:18:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:53,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:53,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:53,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393956259] [2022-07-13 15:18:53,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393956259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:53,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:53,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:18:53,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365989680] [2022-07-13 15:18:53,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:53,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:18:53,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:53,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:18:53,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:18:53,293 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:53,340 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-07-13 15:18:53,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:18:53,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 15:18:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:53,342 INFO L225 Difference]: With dead ends: 56 [2022-07-13 15:18:53,342 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 15:18:53,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:18:53,346 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:53,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:18:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 15:18:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-07-13 15:18:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-07-13 15:18:53,357 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2022-07-13 15:18:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:53,358 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-13 15:18:53,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-07-13 15:18:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 15:18:53,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:53,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:53,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:18:53,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:53,365 INFO L85 PathProgramCache]: Analyzing trace with hash 459687026, now seen corresponding path program 1 times [2022-07-13 15:18:53,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:53,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748491647] [2022-07-13 15:18:53,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:53,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:53,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:53,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748491647] [2022-07-13 15:18:53,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748491647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:53,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:53,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:18:53,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466778771] [2022-07-13 15:18:53,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:53,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:18:53,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:53,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:18:53,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:18:53,537 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:53,698 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-07-13 15:18:53,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:18:53,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 15:18:53,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:53,700 INFO L225 Difference]: With dead ends: 74 [2022-07-13 15:18:53,700 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 15:18:53,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:18:53,701 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:53,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:18:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 15:18:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2022-07-13 15:18:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-07-13 15:18:53,716 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 11 [2022-07-13 15:18:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:53,717 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-07-13 15:18:53,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-07-13 15:18:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 15:18:53,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:53,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:53,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:18:53,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash 608373907, now seen corresponding path program 1 times [2022-07-13 15:18:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:53,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327982629] [2022-07-13 15:18:53,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:53,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:53,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:53,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327982629] [2022-07-13 15:18:53,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327982629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:53,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:53,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:18:53,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321603677] [2022-07-13 15:18:53,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:53,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:18:53,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:18:53,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:18:53,791 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:53,869 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2022-07-13 15:18:53,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:18:53,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 15:18:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:53,870 INFO L225 Difference]: With dead ends: 106 [2022-07-13 15:18:53,879 INFO L226 Difference]: Without dead ends: 57 [2022-07-13 15:18:53,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:18:53,888 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:53,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:18:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-13 15:18:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-07-13 15:18:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-07-13 15:18:53,894 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 11 [2022-07-13 15:18:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:53,894 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-07-13 15:18:53,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-07-13 15:18:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 15:18:53,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:53,895 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:53,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:18:53,895 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:53,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2110602732, now seen corresponding path program 1 times [2022-07-13 15:18:53,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:53,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108480176] [2022-07-13 15:18:53,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:53,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:54,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108480176] [2022-07-13 15:18:54,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108480176] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:54,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742447291] [2022-07-13 15:18:54,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:54,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:54,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:54,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:54,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:18:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:54,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-13 15:18:54,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:54,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:18:54,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 26 [2022-07-13 15:18:54,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-13 15:18:54,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-07-13 15:18:54,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-07-13 15:18:54,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-13 15:18:54,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-07-13 15:18:54,417 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:54,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-13 15:18:54,537 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-13 15:18:54,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2022-07-13 15:18:54,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-07-13 15:18:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:54,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:54,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742447291] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:54,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:54,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-13 15:18:54,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823928488] [2022-07-13 15:18:54,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:54,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 15:18:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:54,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 15:18:54,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:18:54,751 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:54,901 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2022-07-13 15:18:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:18:54,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-13 15:18:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:54,903 INFO L225 Difference]: With dead ends: 121 [2022-07-13 15:18:54,903 INFO L226 Difference]: Without dead ends: 83 [2022-07-13 15:18:54,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:18:54,904 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:54,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 225 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-07-13 15:18:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-13 15:18:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2022-07-13 15:18:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2022-07-13 15:18:54,912 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 14 [2022-07-13 15:18:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:54,912 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2022-07-13 15:18:54,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2022-07-13 15:18:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:18:54,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:54,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:54,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 15:18:55,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:55,136 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash 969563825, now seen corresponding path program 1 times [2022-07-13 15:18:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:55,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743601241] [2022-07-13 15:18:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:55,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:55,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743601241] [2022-07-13 15:18:55,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743601241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:55,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:55,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:18:55,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847409681] [2022-07-13 15:18:55,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:55,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:18:55,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:55,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:18:55,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:18:55,178 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:55,208 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2022-07-13 15:18:55,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:18:55,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 15:18:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:55,209 INFO L225 Difference]: With dead ends: 117 [2022-07-13 15:18:55,209 INFO L226 Difference]: Without dead ends: 79 [2022-07-13 15:18:55,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:18:55,210 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:55,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:18:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-13 15:18:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-07-13 15:18:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-07-13 15:18:55,218 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 19 [2022-07-13 15:18:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:55,219 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-07-13 15:18:55,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-07-13 15:18:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 15:18:55,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:55,220 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:55,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:18:55,220 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:55,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1377311315, now seen corresponding path program 1 times [2022-07-13 15:18:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:55,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114866731] [2022-07-13 15:18:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:18:55,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:55,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114866731] [2022-07-13 15:18:55,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114866731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:55,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202401547] [2022-07-13 15:18:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:55,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:55,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:55,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:55,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:18:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:55,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-13 15:18:55,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:55,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-07-13 15:18:55,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 15:18:55,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 15:18:55,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:18:55,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 15:18:55,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:18:55,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:18:55,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-13 15:18:55,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:18:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:18:55,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:55,650 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:55,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2022-07-13 15:18:55,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-13 15:18:55,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 15:18:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:18:55,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202401547] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:55,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:55,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-13 15:18:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469919719] [2022-07-13 15:18:55,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:55,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 15:18:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 15:18:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-13 15:18:55,730 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:56,401 INFO L93 Difference]: Finished difference Result 252 states and 333 transitions. [2022-07-13 15:18:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 15:18:56,403 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 15:18:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:56,404 INFO L225 Difference]: With dead ends: 252 [2022-07-13 15:18:56,404 INFO L226 Difference]: Without dead ends: 198 [2022-07-13 15:18:56,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 15:18:56,405 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 209 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:56,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 340 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:18:56,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-13 15:18:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 91. [2022-07-13 15:18:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2022-07-13 15:18:56,413 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 22 [2022-07-13 15:18:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:56,413 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2022-07-13 15:18:56,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-07-13 15:18:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:18:56,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:56,414 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:56,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:56,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-13 15:18:56,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:56,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:56,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1662719123, now seen corresponding path program 2 times [2022-07-13 15:18:56,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:56,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861009045] [2022-07-13 15:18:56,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:56,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:56,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861009045] [2022-07-13 15:18:56,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861009045] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:56,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478002518] [2022-07-13 15:18:56,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:18:56,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:56,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:56,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:56,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 15:18:57,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:18:57,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:57,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-13 15:18:57,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:57,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:18:57,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 15:18:57,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 15:18:57,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:18:57,104 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-13 15:18:57,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-07-13 15:18:57,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:18:57,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-07-13 15:18:57,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2022-07-13 15:18:57,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-07-13 15:18:57,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2022-07-13 15:18:57,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2022-07-13 15:18:57,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 15:18:57,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 15:18:57,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,358 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:18:57,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-13 15:18:57,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:57,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,472 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:57,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2022-07-13 15:18:57,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,480 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:18:57,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-13 15:18:57,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:18:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:57,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:57,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_ArrVal_517 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_525 Int)) (or (<= 1 (select (select (store (store |c_#memory_int| v_ArrVal_525 v_ArrVal_512) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_515) (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_525 (store v_ArrVal_517 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_517) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_514) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_525) 8)))) (not (< v_ArrVal_525 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_525) 0)))) is different from false [2022-07-13 15:18:57,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:57,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 377 treesize of output 380 [2022-07-13 15:18:57,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2022-07-13 15:18:57,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 210 [2022-07-13 15:18:57,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_525 Int)) (or (and (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#queue~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8)))) (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_525 (store v_ArrVal_517 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_517) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_514) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_525) 8)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (not (= v_ArrVal_525 (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8))))) (not (< v_ArrVal_525 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_525) 0)))) is different from false [2022-07-13 15:18:57,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:57,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2022-07-13 15:18:57,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2022-07-13 15:18:57,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-07-13 15:18:57,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-07-13 15:18:57,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-13 15:18:58,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2022-07-13 15:18:58,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:58,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (v_ArrVal_506 (Array Int Int)) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~new_process~0#1.base_9| Int) (v_ArrVal_525 Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~new_process~0#1.base_9| 1) v_ArrVal_525) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~new_process~0#1.base_9|) 0)) (not (< v_ArrVal_525 |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (not (= v_ArrVal_525 (select (select (let ((.cse0 (store (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_506) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_508) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_9|)))) (store (store .cse0 v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store .cse0 v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse0 v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525))) v_ArrVal_525) 8)))) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (= |v_ULTIMATE.start_main_~new_process~0#1.base_9| (select (select (let ((.cse1 (store (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_506) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_508) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_9|)))) (store (store .cse1 v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store .cse1 v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse1 v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525))) v_ArrVal_525) 8))) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (not (= (select (select (let ((.cse2 (store (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_506) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_508) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_9|)))) (store (store .cse2 v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store .cse2 v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse2 v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525))) v_ArrVal_525) 8) |c_ULTIMATE.start_main_~#queue~0#1.base|))) (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (+ (select (select (let ((.cse3 (store (store |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_505) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_507) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse3 v_ArrVal_525 (store v_ArrVal_517 8 (select (select (store .cse3 v_ArrVal_525 v_ArrVal_517) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse3 v_ArrVal_525 v_ArrVal_514) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) v_ArrVal_525) 8) 4) 4))))) is different from false [2022-07-13 15:18:58,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2022-07-13 15:18:58,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2022-07-13 15:18:58,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-07-13 15:18:58,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-07-13 15:18:58,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-13 15:18:58,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2022-07-13 15:18:58,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:58,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2022-07-13 15:18:58,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2022-07-13 15:18:58,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-07-13 15:18:58,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-07-13 15:18:58,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-13 15:18:58,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2022-07-13 15:18:58,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:58,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2022-07-13 15:18:58,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2022-07-13 15:18:58,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-07-13 15:18:58,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-07-13 15:18:58,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-13 15:18:58,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2022-07-13 15:18:58,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:58,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-13 15:18:58,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478002518] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:58,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:58,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-07-13 15:18:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073760923] [2022-07-13 15:18:58,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:58,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 15:18:58,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:58,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 15:18:58,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=466, Unknown=4, NotChecked=138, Total=702 [2022-07-13 15:18:58,415 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:59,153 INFO L93 Difference]: Finished difference Result 173 states and 221 transitions. [2022-07-13 15:18:59,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 15:18:59,153 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-13 15:18:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:59,154 INFO L225 Difference]: With dead ends: 173 [2022-07-13 15:18:59,154 INFO L226 Difference]: Without dead ends: 171 [2022-07-13 15:18:59,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=827, Unknown=5, NotChecked=192, Total=1260 [2022-07-13 15:18:59,155 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:59,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 382 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 234 Invalid, 0 Unknown, 247 Unchecked, 0.2s Time] [2022-07-13 15:18:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-13 15:18:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 148. [2022-07-13 15:18:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 147 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) [2022-07-13 15:18:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 190 transitions. [2022-07-13 15:18:59,164 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 190 transitions. Word has length 25 [2022-07-13 15:18:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:59,164 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 190 transitions. [2022-07-13 15:18:59,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:18:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2022-07-13 15:18:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 15:18:59,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:59,165 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:59,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 15:18:59,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:59,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:59,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash 211481171, now seen corresponding path program 3 times [2022-07-13 15:18:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:59,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673518155] [2022-07-13 15:18:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:59,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:59,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673518155] [2022-07-13 15:18:59,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673518155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:59,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702714842] [2022-07-13 15:18:59,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:18:59,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:59,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:59,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:59,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 15:18:59,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 15:18:59,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:59,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-13 15:18:59,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:59,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-13 15:18:59,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-13 15:18:59,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-13 15:18:59,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-13 15:18:59,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-13 15:19:00,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 15:19:00,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 15:19:00,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:00,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:00,166 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-13 15:19:00,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2022-07-13 15:19:00,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:00,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:00,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:00,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:00,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-13 15:19:00,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2022-07-13 15:19:00,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-13 15:19:00,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 15:19:00,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 15:19:00,200 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:19:00,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-07-13 15:19:00,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:00,410 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-07-13 15:19:00,410 INFO L390 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 154 treesize of output 84 [2022-07-13 15:19:00,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:00,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:00,426 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:19:00,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-07-13 15:19:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:19:00,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:01,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 15:19:01,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 Int) (v_ArrVal_691 Int)) (or (not (< v_ArrVal_691 |c_#StackHeapBarrier|)) (= v_ArrVal_691 v_ArrVal_663) (not (< v_ArrVal_663 |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (= (let ((.cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse3 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse3 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse3 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (select (select .cse0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse1 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse1 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse1 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))) v_ArrVal_691) 8)) (+ (select (select .cse0 v_ArrVal_691) 8) 8))) 0)) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (= (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse5 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse5 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse5 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))))) (select .cse4 (select (select .cse4 v_ArrVal_691) 8))) (+ (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse7 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse7 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse7 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) v_ArrVal_691) 8) 8)) 0))))) is different from false [2022-07-13 15:19:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-13 15:19:02,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702714842] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:02,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:02,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-13 15:19:02,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469827112] [2022-07-13 15:19:02,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:02,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 15:19:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:02,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 15:19:02,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-07-13 15:19:02,360 INFO L87 Difference]: Start difference. First operand 148 states and 190 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:04,389 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#queue~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_663 Int) (v_ArrVal_691 Int)) (or (not (< v_ArrVal_691 |c_#StackHeapBarrier|)) (= v_ArrVal_691 v_ArrVal_663) (not (< v_ArrVal_663 |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (= (let ((.cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse3 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse3 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse3 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (select (select .cse0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse1 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse1 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse1 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))) v_ArrVal_691) 8)) (+ (select (select .cse0 v_ArrVal_691) 8) 8))) 0)) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (= (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse5 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse5 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse5 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))))) (select .cse4 (select (select .cse4 v_ArrVal_691) 8))) (+ (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse7 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse7 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse7 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) v_ArrVal_691) 8) 8)) 0))))) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)) is different from false [2022-07-13 15:19:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:04,944 INFO L93 Difference]: Finished difference Result 363 states and 472 transitions. [2022-07-13 15:19:04,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 15:19:04,944 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 15:19:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:04,945 INFO L225 Difference]: With dead ends: 363 [2022-07-13 15:19:04,945 INFO L226 Difference]: Without dead ends: 241 [2022-07-13 15:19:04,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=111, Invalid=597, Unknown=2, NotChecked=102, Total=812 [2022-07-13 15:19:04,946 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 118 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:04,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 380 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 172 Invalid, 0 Unknown, 124 Unchecked, 0.2s Time] [2022-07-13 15:19:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-13 15:19:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 192. [2022-07-13 15:19:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.2722513089005236) internal successors, (243), 191 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 243 transitions. [2022-07-13 15:19:04,957 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 243 transitions. Word has length 28 [2022-07-13 15:19:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:04,957 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 243 transitions. [2022-07-13 15:19:04,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 243 transitions. [2022-07-13 15:19:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:19:04,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:04,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:04,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:19:05,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:05,175 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:05,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1324510600, now seen corresponding path program 1 times [2022-07-13 15:19:05,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:05,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568310679] [2022-07-13 15:19:05,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:05,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:19:05,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:05,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568310679] [2022-07-13 15:19:05,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568310679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:05,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240726872] [2022-07-13 15:19:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:05,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:05,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:05,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:19:05,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 15:19:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:05,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:19:05,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:19:05,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:19:05,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240726872] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:05,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:05,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-13 15:19:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383552223] [2022-07-13 15:19:05,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:05,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:19:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:05,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:19:05,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:19:05,480 INFO L87 Difference]: Start difference. First operand 192 states and 243 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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) [2022-07-13 15:19:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:05,575 INFO L93 Difference]: Finished difference Result 637 states and 823 transitions. [2022-07-13 15:19:05,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 15:19:05,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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 29 [2022-07-13 15:19:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:05,577 INFO L225 Difference]: With dead ends: 637 [2022-07-13 15:19:05,577 INFO L226 Difference]: Without dead ends: 471 [2022-07-13 15:19:05,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:19:05,578 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 82 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:05,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:19:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-07-13 15:19:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 400. [2022-07-13 15:19:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.2531328320802004) internal successors, (500), 399 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 500 transitions. [2022-07-13 15:19:05,598 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 500 transitions. Word has length 29 [2022-07-13 15:19:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:05,599 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 500 transitions. [2022-07-13 15:19:05,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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) [2022-07-13 15:19:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 500 transitions. [2022-07-13 15:19:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:19:05,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:05,600 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:05,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:19:05,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 15:19:05,817 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:05,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:05,817 INFO L85 PathProgramCache]: Analyzing trace with hash -313393350, now seen corresponding path program 1 times [2022-07-13 15:19:05,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:05,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440457012] [2022-07-13 15:19:05,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:05,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:06,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:06,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440457012] [2022-07-13 15:19:06,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440457012] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:06,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287741694] [2022-07-13 15:19:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:06,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:06,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:06,115 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:19:06,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 15:19:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:06,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-13 15:19:06,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:06,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:19:06,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:06,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:06,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 15:19:06,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:06,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:06,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 15:19:06,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:19:06,264 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:19:06,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-13 15:19:06,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:19:06,464 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:19:06,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 99 [2022-07-13 15:19:06,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 30 [2022-07-13 15:19:06,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-13 15:19:06,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-13 15:19:06,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-13 15:19:06,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:19:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:06,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:06,593 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_choose_next_#t~mem5#1| 1) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_863 Int) (v_ArrVal_864 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 4))) (or (not (<= (select .cse0 .cse1) (+ v_ArrVal_863 1))) (<= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base| (store .cse0 .cse1 v_ArrVal_863)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))))))) is different from false [2022-07-13 15:19:06,602 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 4)) 1) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_863 Int) (v_ArrVal_864 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 4))) (or (not (<= (select .cse0 .cse1) (+ v_ArrVal_863 1))) (<= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base| (store .cse0 .cse1 v_ArrVal_863)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))))))) is different from false [2022-07-13 15:19:06,611 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4)) 1) (forall ((v_ArrVal_863 Int) (v_ArrVal_865 (Array Int Int)) (v_ArrVal_864 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (let ((.cse0 (select |c_#memory_int| .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))) (or (not (<= (select .cse0 .cse1) (+ v_ArrVal_863 1))) (<= 1 (select (select (store |c_#memory_int| .cse2 (store .cse0 .cse1 v_ArrVal_863)) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4)))))))) is different from false [2022-07-13 15:19:06,742 INFO L356 Elim1Store]: treesize reduction 16, result has 84.9 percent of original size [2022-07-13 15:19:06,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 193 [2022-07-13 15:19:06,899 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |c_ULTIMATE.start_check_queue_~n~0#1.offset|)) (forall ((v_ArrVal_865 (Array Int Int))) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))) is different from false [2022-07-13 15:19:06,904 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (forall ((v_ArrVal_865 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) .cse0)))) is different from false [2022-07-13 15:19:06,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:19:06,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-13 15:19:06,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287741694] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:06,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:06,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2022-07-13 15:19:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632514720] [2022-07-13 15:19:06,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:06,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 15:19:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:06,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 15:19:06,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=526, Unknown=5, NotChecked=250, Total=870 [2022-07-13 15:19:06,936 INFO L87 Difference]: Start difference. First operand 400 states and 500 transitions. Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:07,673 INFO L93 Difference]: Finished difference Result 601 states and 758 transitions. [2022-07-13 15:19:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:19:07,673 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 15:19:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:07,675 INFO L225 Difference]: With dead ends: 601 [2022-07-13 15:19:07,675 INFO L226 Difference]: Without dead ends: 446 [2022-07-13 15:19:07,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=1053, Unknown=9, NotChecked=360, Total=1640 [2022-07-13 15:19:07,676 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:07,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 330 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 232 Invalid, 0 Unknown, 190 Unchecked, 0.2s Time] [2022-07-13 15:19:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-07-13 15:19:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 415. [2022-07-13 15:19:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.2536231884057971) internal successors, (519), 414 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 519 transitions. [2022-07-13 15:19:07,730 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 519 transitions. Word has length 29 [2022-07-13 15:19:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:07,730 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 519 transitions. [2022-07-13 15:19:07,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 519 transitions. [2022-07-13 15:19:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 15:19:07,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:07,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:07,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:19:07,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:07,952 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:07,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -190827821, now seen corresponding path program 1 times [2022-07-13 15:19:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:07,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422086938] [2022-07-13 15:19:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:07,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:08,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:08,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422086938] [2022-07-13 15:19:08,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422086938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:08,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656308885] [2022-07-13 15:19:08,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:08,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:08,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:08,078 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:19:08,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 15:19:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:08,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-13 15:19:08,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:08,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:19:08,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:08,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:08,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-13 15:19:08,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:08,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:08,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-13 15:19:08,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-13 15:19:08,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-13 15:19:08,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:19:08,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:19:08,232 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:19:08,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-13 15:19:08,326 INFO L356 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2022-07-13 15:19:08,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2022-07-13 15:19:08,343 INFO L356 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-07-13 15:19:08,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 24 [2022-07-13 15:19:08,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2022-07-13 15:19:08,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2022-07-13 15:19:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:19:08,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:19:08,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656308885] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:08,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:08,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 19 [2022-07-13 15:19:08,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944173659] [2022-07-13 15:19:08,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:08,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 15:19:08,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 15:19:08,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-13 15:19:08,555 INFO L87 Difference]: Start difference. First operand 415 states and 519 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:10,207 INFO L93 Difference]: Finished difference Result 1389 states and 1808 transitions. [2022-07-13 15:19:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-13 15:19:10,231 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-13 15:19:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:10,236 INFO L225 Difference]: With dead ends: 1389 [2022-07-13 15:19:10,236 INFO L226 Difference]: Without dead ends: 975 [2022-07-13 15:19:10,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=2562, Unknown=0, NotChecked=0, Total=3192 [2022-07-13 15:19:10,238 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 387 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:10,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 770 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 479 Invalid, 0 Unknown, 115 Unchecked, 0.7s Time] [2022-07-13 15:19:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-07-13 15:19:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 616. [2022-07-13 15:19:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 615 states have (on average 1.305691056910569) internal successors, (803), 615 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 803 transitions. [2022-07-13 15:19:10,299 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 803 transitions. Word has length 30 [2022-07-13 15:19:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:10,299 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 803 transitions. [2022-07-13 15:19:10,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 803 transitions. [2022-07-13 15:19:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 15:19:10,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:10,301 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:10,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:19:10,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:10,514 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash -583854831, now seen corresponding path program 1 times [2022-07-13 15:19:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:10,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767297161] [2022-07-13 15:19:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:19:10,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767297161] [2022-07-13 15:19:10,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767297161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:19:10,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:19:10,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:19:10,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56661179] [2022-07-13 15:19:10,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:19:10,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:19:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:19:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:19:10,539 INFO L87 Difference]: Start difference. First operand 616 states and 803 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:10,568 INFO L93 Difference]: Finished difference Result 1302 states and 1699 transitions. [2022-07-13 15:19:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:19:10,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 30 [2022-07-13 15:19:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:10,570 INFO L225 Difference]: With dead ends: 1302 [2022-07-13 15:19:10,570 INFO L226 Difference]: Without dead ends: 802 [2022-07-13 15:19:10,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:19:10,571 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:10,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:19:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-13 15:19:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 589. [2022-07-13 15:19:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.2942176870748299) internal successors, (761), 588 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 761 transitions. [2022-07-13 15:19:10,598 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 761 transitions. Word has length 30 [2022-07-13 15:19:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:10,598 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 761 transitions. [2022-07-13 15:19:10,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 761 transitions. [2022-07-13 15:19:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 15:19:10,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:10,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:10,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 15:19:10,599 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1070079280, now seen corresponding path program 1 times [2022-07-13 15:19:10,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:10,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529091816] [2022-07-13 15:19:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:10,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:10,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:10,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529091816] [2022-07-13 15:19:10,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529091816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:10,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836552369] [2022-07-13 15:19:10,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:10,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:10,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:10,742 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:19:10,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 15:19:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:10,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-13 15:19:10,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:10,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:19:10,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-13 15:19:10,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-13 15:19:10,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-13 15:19:10,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-13 15:19:10,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:19:10,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-13 15:19:10,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:19:10,912 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:19:10,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-13 15:19:11,071 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:19:11,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 53 [2022-07-13 15:19:11,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2022-07-13 15:19:11,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-07-13 15:19:11,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-07-13 15:19:11,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 15:19:11,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 15:19:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:11,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:11,099 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1105 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1105) |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8)) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1104) |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8)) 0))) is different from false [2022-07-13 15:19:11,108 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1105 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1105) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)))) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1104) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)) 0))) is different from false [2022-07-13 15:19:11,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:11,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:11,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-13 15:19:11,269 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-07-13 15:19:11,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 70 [2022-07-13 15:19:11,276 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:11,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2022-07-13 15:19:11,284 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:11,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 95 [2022-07-13 15:19:11,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 120 [2022-07-13 15:19:11,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:11,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 120 [2022-07-13 15:19:11,304 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:11,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-13 15:19:11,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:11,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 134 [2022-07-13 15:19:11,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:11,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:11,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-07-13 15:19:11,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 15:19:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-13 15:19:11,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836552369] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:11,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:11,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-07-13 15:19:11,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36764663] [2022-07-13 15:19:11,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:11,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 15:19:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:11,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 15:19:11,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=311, Unknown=2, NotChecked=74, Total=462 [2022-07-13 15:19:11,383 INFO L87 Difference]: Start difference. First operand 589 states and 761 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:12,559 INFO L93 Difference]: Finished difference Result 1914 states and 2478 transitions. [2022-07-13 15:19:12,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 15:19:12,559 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-13 15:19:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:12,564 INFO L225 Difference]: With dead ends: 1914 [2022-07-13 15:19:12,564 INFO L226 Difference]: Without dead ends: 1426 [2022-07-13 15:19:12,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 12 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=540, Invalid=1358, Unknown=2, NotChecked=170, Total=2070 [2022-07-13 15:19:12,566 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 355 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:12,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 615 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 339 Invalid, 0 Unknown, 345 Unchecked, 0.4s Time] [2022-07-13 15:19:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2022-07-13 15:19:12,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 927. [2022-07-13 15:19:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 926 states have (on average 1.2688984881209504) internal successors, (1175), 926 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1175 transitions. [2022-07-13 15:19:12,623 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1175 transitions. Word has length 33 [2022-07-13 15:19:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:12,623 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 1175 transitions. [2022-07-13 15:19:12,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1175 transitions. [2022-07-13 15:19:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 15:19:12,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:12,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:12,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 15:19:12,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 15:19:12,830 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:12,830 INFO L85 PathProgramCache]: Analyzing trace with hash -196846093, now seen corresponding path program 1 times [2022-07-13 15:19:12,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:12,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108597862] [2022-07-13 15:19:12,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:12,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 15:19:13,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:13,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108597862] [2022-07-13 15:19:13,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108597862] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:13,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883012765] [2022-07-13 15:19:13,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:13,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:13,068 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:19:13,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 15:19:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:13,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 131 conjunts are in the unsatisfiable core [2022-07-13 15:19:13,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:13,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:19:13,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 15:19:13,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 15:19:13,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:19:13,313 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-13 15:19:13,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-07-13 15:19:13,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:19:13,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-07-13 15:19:13,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2022-07-13 15:19:13,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2022-07-13 15:19:13,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2022-07-13 15:19:13,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2022-07-13 15:19:13,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-07-13 15:19:13,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,587 INFO L356 Elim1Store]: treesize reduction 4, result has 84.6 percent of original size [2022-07-13 15:19:13,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2022-07-13 15:19:13,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-07-13 15:19:13,711 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-13 15:19:13,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 53 [2022-07-13 15:19:13,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,714 INFO L390 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-07-13 15:19:13,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:19:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 15:19:13,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:13,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1266 Int) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1262 (Array Int Int)) (v_ArrVal_1260 (Array Int Int))) (or (not (< v_ArrVal_1266 |c_#StackHeapBarrier|)) (<= 1 (let ((.cse1 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (store (store |c_#memory_int| v_ArrVal_1266 v_ArrVal_1263) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1262) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| v_ArrVal_1266 (store v_ArrVal_1254 .cse1 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1266 v_ArrVal_1254) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1266))) v_ArrVal_1266) .cse1)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1266 (store v_ArrVal_1252 .cse1 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1266 v_ArrVal_1252) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1266 v_ArrVal_1260) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_13|)) v_ArrVal_1266) .cse1) 4)))) (not (= (select |c_#valid| v_ArrVal_1266) 0)))) is different from false [2022-07-13 15:19:13,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:13,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 505 treesize of output 508 [2022-07-13 15:19:13,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 342 [2022-07-13 15:19:14,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 152 [2022-07-13 15:19:14,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:14,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:14,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int))) (v_ArrVal_1239 (Array Int Int)) (|v_ULTIMATE.start_main_~new_process~0#1.base_21| Int) (v_ArrVal_1266 Int) (v_ArrVal_1246 (Array Int Int)) (|v_#memory_$Pointer$.base_116| (Array Int (Array Int Int))) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~new_process~0#1.base_21|) 0)) (not (< v_ArrVal_1266 |c_#StackHeapBarrier|)) (and (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1260 (Array Int Int))) (= (let ((.cse1 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (let ((.cse0 (store (store |v_#memory_$Pointer$.offset_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1239) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1246) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse0 v_ArrVal_1266 (store v_ArrVal_1252 .cse1 (select (select (store .cse0 v_ArrVal_1266 v_ArrVal_1252) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse0 v_ArrVal_1266 v_ArrVal_1260) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_13|))) v_ArrVal_1266) .cse1)) 0)) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1254 (Array Int Int))) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (let ((.cse2 (let ((.cse3 (store (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1243) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1240) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_21|)))) (store .cse3 v_ArrVal_1266 (store v_ArrVal_1254 .cse4 (select (select (store .cse3 v_ArrVal_1266 v_ArrVal_1254) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))))) (store .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1266))) v_ArrVal_1266) .cse4)) v_ArrVal_1266))) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1254 (Array Int Int))) (= (let ((.cse7 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (let ((.cse5 (let ((.cse6 (store (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1243) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1240) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_21|)))) (store .cse6 v_ArrVal_1266 (store v_ArrVal_1254 .cse7 (select (select (store .cse6 v_ArrVal_1266 v_ArrVal_1254) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))))) (store .cse5 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1266))) v_ArrVal_1266) .cse7)) |v_ULTIMATE.start_main_~new_process~0#1.base_21|)) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1254 (Array Int Int))) (not (= (let ((.cse10 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (let ((.cse8 (let ((.cse9 (store (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1243) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1240) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_21|)))) (store .cse9 v_ArrVal_1266 (store v_ArrVal_1254 .cse10 (select (select (store .cse9 v_ArrVal_1266 v_ArrVal_1254) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))))) (store .cse8 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1266))) v_ArrVal_1266) .cse10)) |c_ULTIMATE.start_main_~#queue~0#1.base|)))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~new_process~0#1.base_21| 1) v_ArrVal_1266) 0)))) is different from false [2022-07-13 15:19:15,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:15,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:15,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:15,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:15,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:15,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:15,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:15,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:15,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:15,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:15,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:15,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:15,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:15,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:15,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2022-07-13 15:19:16,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-13 15:19:16,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-13 15:19:16,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2022-07-13 15:19:16,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:16,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:16,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:16,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:16,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:16,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 19 not checked. [2022-07-13 15:19:16,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883012765] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:16,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:16,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2022-07-13 15:19:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138694473] [2022-07-13 15:19:16,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:16,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 15:19:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 15:19:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=476, Unknown=7, NotChecked=90, Total=650 [2022-07-13 15:19:16,088 INFO L87 Difference]: Start difference. First operand 927 states and 1175 transitions. Second operand has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:16,689 INFO L93 Difference]: Finished difference Result 947 states and 1198 transitions. [2022-07-13 15:19:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:19:16,689 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-13 15:19:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:16,693 INFO L225 Difference]: With dead ends: 947 [2022-07-13 15:19:16,693 INFO L226 Difference]: Without dead ends: 945 [2022-07-13 15:19:16,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=787, Unknown=7, NotChecked=118, Total=1056 [2022-07-13 15:19:16,696 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 67 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:16,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 293 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 156 Unchecked, 0.2s Time] [2022-07-13 15:19:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-07-13 15:19:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 934. [2022-07-13 15:19:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 1.2679528403001072) internal successors, (1183), 933 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1183 transitions. [2022-07-13 15:19:16,750 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1183 transitions. Word has length 33 [2022-07-13 15:19:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:16,750 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1183 transitions. [2022-07-13 15:19:16,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1183 transitions. [2022-07-13 15:19:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:19:16,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:16,751 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:16,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 15:19:16,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 15:19:16,960 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1607684877, now seen corresponding path program 2 times [2022-07-13 15:19:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:16,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861372732] [2022-07-13 15:19:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 15:19:17,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:17,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861372732] [2022-07-13 15:19:17,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861372732] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:17,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748952711] [2022-07-13 15:19:17,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:19:17,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:17,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:17,232 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:19:17,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 15:19:17,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:19:17,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:17,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-13 15:19:17,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:17,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:19:17,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:17,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:17,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 15:19:17,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:17,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-07-13 15:19:17,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:17,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-13 15:19:17,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 15:19:17,497 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-13 15:19:17,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-07-13 15:19:17,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:19:17,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:17,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:17,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:17,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2022-07-13 15:19:17,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:17,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:17,750 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-13 15:19:17,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 64 [2022-07-13 15:19:17,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2022-07-13 15:19:17,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2022-07-13 15:19:17,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 15:19:17,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 15:19:17,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:17,771 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:19:17,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-13 15:19:17,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:18,004 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-07-13 15:19:18,004 INFO L390 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 153 treesize of output 83 [2022-07-13 15:19:18,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:18,022 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:19:18,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-07-13 15:19:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 15:19:18,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:18,972 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-07-13 15:19:18,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1532 treesize of output 1380 [2022-07-13 15:19:19,070 INFO L356 Elim1Store]: treesize reduction 8, result has 97.8 percent of original size [2022-07-13 15:19:19,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87484 treesize of output 82784 [2022-07-13 15:19:19,299 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-07-13 15:19:19,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 80082 treesize of output 22504 [2022-07-13 15:19:19,495 INFO L356 Elim1Store]: treesize reduction 136, result has 43.6 percent of original size [2022-07-13 15:19:19,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 69990 treesize of output 65271 [2022-07-13 15:19:19,933 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:19,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 66568 treesize of output 66263 [2022-07-13 15:19:24,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11590 treesize of output 11494 [2022-07-13 15:19:24,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11494 treesize of output 11398