./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 eb692b52 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-?-eb692b5 [2022-07-19 14:45:52,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:45:52,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:45:52,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:45:52,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:45:52,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:45:52,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:45:52,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:45:52,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:45:52,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:45:52,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:45:52,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:45:52,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:45:52,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:45:52,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:45:52,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:45:52,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:45:52,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:45:52,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:45:52,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:45:52,747 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:45:52,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:45:52,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:45:52,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:45:52,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:45:52,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:45:52,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:45:52,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:45:52,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:45:52,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:45:52,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:45:52,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:45:52,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:45:52,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:45:52,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:45:52,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:45:52,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:45:52,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:45:52,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:45:52,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:45:52,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:45:52,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:45:52,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:45:52,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:45:52,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:45:52,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:45:52,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:45:52,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:45:52,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:45:52,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:45:52,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:45:52,787 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:45:52,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:45:52,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:45:52,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:45:52,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:45:52,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:45:52,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:45:52,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:45:52,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:45:52,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:45:52,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:45:52,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:45:52,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:45:52,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:45:52,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:45:52,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:45:52,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:45:52,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:45:52,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:45:52,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:45:52,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:45:52,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:45:52,791 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:45:52,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:45:52,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:45:52,792 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-19 14:45:52,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:45:52,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:45:52,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:45:52,987 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:45:52,988 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:45:52,988 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-19 14:45:53,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458ca5fd8/aebe11d6fdd245d2ad990516a50ca331/FLAG3cc0b4b74 [2022-07-19 14:45:53,433 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:45:53,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/process_queue.i [2022-07-19 14:45:53,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458ca5fd8/aebe11d6fdd245d2ad990516a50ca331/FLAG3cc0b4b74 [2022-07-19 14:45:53,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458ca5fd8/aebe11d6fdd245d2ad990516a50ca331 [2022-07-19 14:45:53,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:45:53,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:45:53,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:45:53,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:45:53,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:45:53,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671ae070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53, skipping insertion in model container [2022-07-19 14:45:53,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:45:53,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:45:53,699 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-19 14:45:53,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:45:53,709 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:45:53,730 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-19 14:45:53,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:45:53,749 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:45:53,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53 WrapperNode [2022-07-19 14:45:53,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:45:53,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:45:53,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:45:53,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:45:53,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,797 INFO L137 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2022-07-19 14:45:53,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:45:53,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:45:53,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:45:53,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:45:53,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:45:53,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:45:53,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:45:53,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:45:53,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (1/1) ... [2022-07-19 14:45:53,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:45:53,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:45:53,846 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-19 14:45:53,848 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-19 14:45:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:45:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:45:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:45:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:45:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:45:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:45:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:45:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:45:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:45:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:45:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:45:53,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:45:53,937 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:45:53,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:45:54,140 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:45:54,145 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:45:54,146 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 14:45:54,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:45:54 BoogieIcfgContainer [2022-07-19 14:45:54,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:45:54,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:45:54,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:45:54,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:45:54,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:45:53" (1/3) ... [2022-07-19 14:45:54,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edf5211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:45:54, skipping insertion in model container [2022-07-19 14:45:54,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:53" (2/3) ... [2022-07-19 14:45:54,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edf5211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:45:54, skipping insertion in model container [2022-07-19 14:45:54,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:45:54" (3/3) ... [2022-07-19 14:45:54,162 INFO L111 eAbstractionObserver]: Analyzing ICFG process_queue.i [2022-07-19 14:45:54,172 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:45:54,172 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:45:54,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:45:54,207 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@663ef566, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17f1f06e [2022-07-19 14:45:54,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:45:54,214 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-19 14:45:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:45:54,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:54,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:54,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2060272908, now seen corresponding path program 1 times [2022-07-19 14:45:54,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:54,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595114012] [2022-07-19 14:45:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:54,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:54,368 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-19 14:45:54,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:54,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595114012] [2022-07-19 14:45:54,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595114012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:45:54,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:45:54,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:45:54,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353279404] [2022-07-19 14:45:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:45:54,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:45:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:54,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:45:54,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:45:54,392 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-19 14:45:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:54,416 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-07-19 14:45:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:45:54,419 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-19 14:45:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:54,424 INFO L225 Difference]: With dead ends: 51 [2022-07-19 14:45:54,424 INFO L226 Difference]: Without dead ends: 23 [2022-07-19 14:45:54,427 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-19 14:45:54,430 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-19 14:45:54,431 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-19 14:45:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-19 14:45:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-19 14:45:54,449 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-19 14:45:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-07-19 14:45:54,451 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-07-19 14:45:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:54,451 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-19 14:45:54,452 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-19 14:45:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-07-19 14:45:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:45:54,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:54,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:54,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:45:54,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1911586027, now seen corresponding path program 1 times [2022-07-19 14:45:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:54,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325507109] [2022-07-19 14:45:54,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:54,496 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-19 14:45:54,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:54,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325507109] [2022-07-19 14:45:54,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325507109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:45:54,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:45:54,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:45:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650554461] [2022-07-19 14:45:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:45:54,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:45:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:54,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:45:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:45:54,501 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-19 14:45:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:54,546 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-07-19 14:45:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:45:54,547 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-19 14:45:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:54,547 INFO L225 Difference]: With dead ends: 56 [2022-07-19 14:45:54,548 INFO L226 Difference]: Without dead ends: 35 [2022-07-19 14:45:54,551 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-19 14:45:54,552 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-19 14:45:54,552 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-19 14:45:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-19 14:45:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-07-19 14:45:54,560 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-19 14:45:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-07-19 14:45:54,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2022-07-19 14:45:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:54,565 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-19 14:45:54,565 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-19 14:45:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-07-19 14:45:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:45:54,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:54,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:54,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:45:54,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:54,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash 459687026, now seen corresponding path program 1 times [2022-07-19 14:45:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:54,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578500559] [2022-07-19 14:45:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:54,726 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-19 14:45:54,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:54,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578500559] [2022-07-19 14:45:54,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578500559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:45:54,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:45:54,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:45:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434136944] [2022-07-19 14:45:54,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:45:54,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:45:54,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:54,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:45:54,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:45:54,731 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-19 14:45:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:54,915 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-07-19 14:45:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:45:54,916 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-19 14:45:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:54,917 INFO L225 Difference]: With dead ends: 74 [2022-07-19 14:45:54,918 INFO L226 Difference]: Without dead ends: 72 [2022-07-19 14:45:54,918 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-19 14:45:54,919 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-19 14:45:54,919 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-19 14:45:54,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-19 14:45:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2022-07-19 14:45:54,928 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-19 14:45:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-07-19 14:45:54,930 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 11 [2022-07-19 14:45:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:54,930 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-07-19 14:45:54,931 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-19 14:45:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-07-19 14:45:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:45:54,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:54,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:54,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:45:54,932 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:54,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash 608373907, now seen corresponding path program 1 times [2022-07-19 14:45:54,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:54,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921315801] [2022-07-19 14:45:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:54,989 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-19 14:45:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:54,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921315801] [2022-07-19 14:45:54,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921315801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:45:54,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:45:54,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:45:54,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793569954] [2022-07-19 14:45:54,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:45:54,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:45:54,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:54,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:45:54,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:45:54,994 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-19 14:45:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:55,045 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2022-07-19 14:45:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:45:55,046 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-19 14:45:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:55,047 INFO L225 Difference]: With dead ends: 106 [2022-07-19 14:45:55,047 INFO L226 Difference]: Without dead ends: 57 [2022-07-19 14:45:55,047 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-19 14:45:55,057 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:45:55,058 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.0s Time] [2022-07-19 14:45:55,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-19 14:45:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-07-19 14:45:55,068 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-19 14:45:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-07-19 14:45:55,069 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 11 [2022-07-19 14:45:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:55,069 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-07-19 14:45:55,069 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-19 14:45:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-07-19 14:45:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 14:45:55,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:55,070 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:55,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 14:45:55,071 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2110602732, now seen corresponding path program 1 times [2022-07-19 14:45:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:55,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868145218] [2022-07-19 14:45:55,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:55,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:55,200 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-19 14:45:55,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:55,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868145218] [2022-07-19 14:45:55,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868145218] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:45:55,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085636703] [2022-07-19 14:45:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:55,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:55,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:45:55,203 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-19 14:45:55,239 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-19 14:45:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:55,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-19 14:45:55,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:45:55,321 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-19 14:45:55,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:55,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:55,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-19 14:45:55,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:55,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:55,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-19 14:45:55,389 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-19 14:45:55,394 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-19 14:45:55,398 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-19 14:45:55,401 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-19 14:45:55,408 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:45:55,409 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-19 14:45:55,493 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-19 14:45:55,493 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-19 14:45:55,499 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-19 14:45:55,503 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-19 14:45:55,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:45:55,642 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-19 14:45:55,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085636703] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:45:55,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:45:55,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-19 14:45:55,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808738360] [2022-07-19 14:45:55,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:45:55,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:45:55,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:55,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:45:55,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:45:55,644 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-19 14:45:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:55,787 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2022-07-19 14:45:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:45:55,787 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-19 14:45:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:55,788 INFO L225 Difference]: With dead ends: 121 [2022-07-19 14:45:55,788 INFO L226 Difference]: Without dead ends: 83 [2022-07-19 14:45:55,788 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-19 14:45:55,789 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-19 14:45:55,789 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-19 14:45:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-19 14:45:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2022-07-19 14:45:55,793 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-19 14:45:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2022-07-19 14:45:55,794 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 14 [2022-07-19 14:45:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:55,794 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2022-07-19 14:45:55,794 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-19 14:45:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2022-07-19 14:45:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:45:55,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:55,795 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:55,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:45:56,003 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-19 14:45:56,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:56,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash 969563825, now seen corresponding path program 1 times [2022-07-19 14:45:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:56,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115287425] [2022-07-19 14:45:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:56,054 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-19 14:45:56,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:56,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115287425] [2022-07-19 14:45:56,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115287425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:45:56,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:45:56,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:45:56,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037313559] [2022-07-19 14:45:56,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:45:56,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:45:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:45:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:45:56,056 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-19 14:45:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:56,086 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2022-07-19 14:45:56,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:45:56,087 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-19 14:45:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:56,087 INFO L225 Difference]: With dead ends: 117 [2022-07-19 14:45:56,087 INFO L226 Difference]: Without dead ends: 79 [2022-07-19 14:45:56,088 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-19 14:45:56,088 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-19 14:45:56,089 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-19 14:45:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-19 14:45:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-07-19 14:45:56,093 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-19 14:45:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-07-19 14:45:56,094 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 19 [2022-07-19 14:45:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:56,094 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-07-19 14:45:56,094 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-19 14:45:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-07-19 14:45:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 14:45:56,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:56,095 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:56,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 14:45:56,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1377311315, now seen corresponding path program 1 times [2022-07-19 14:45:56,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:56,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007909651] [2022-07-19 14:45:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:56,189 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-19 14:45:56,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:56,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007909651] [2022-07-19 14:45:56,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007909651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:45:56,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039215912] [2022-07-19 14:45:56,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:56,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:56,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:45:56,192 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-19 14:45:56,200 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-19 14:45:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:56,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-19 14:45:56,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:45:56,385 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-19 14:45:56,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:56,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:56,391 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-19 14:45:56,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:56,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:56,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-19 14:45:56,399 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-19 14:45:56,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:56,402 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-19 14:45:56,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 8 treesize of output 7 [2022-07-19 14:45:56,449 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-19 14:45:56,452 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-19 14:45:56,468 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-19 14:45:56,478 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-19 14:45:56,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:45:56,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:45:56,518 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-19 14:45:56,521 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-19 14:45:56,524 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-19 14:45:56,590 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-19 14:45:56,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039215912] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:45:56,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:45:56,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-19 14:45:56,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034002996] [2022-07-19 14:45:56,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:45:56,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 14:45:56,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:56,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 14:45:56,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-19 14:45:56,592 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-19 14:45:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:57,256 INFO L93 Difference]: Finished difference Result 252 states and 333 transitions. [2022-07-19 14:45:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 14:45:57,257 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-19 14:45:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:57,257 INFO L225 Difference]: With dead ends: 252 [2022-07-19 14:45:57,257 INFO L226 Difference]: Without dead ends: 198 [2022-07-19 14:45:57,258 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-19 14:45:57,258 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-19 14:45:57,259 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-19 14:45:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-19 14:45:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 91. [2022-07-19 14:45:57,271 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-19 14:45:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2022-07-19 14:45:57,273 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 22 [2022-07-19 14:45:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:57,273 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2022-07-19 14:45:57,273 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-19 14:45:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-07-19 14:45:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:45:57,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:57,275 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:57,297 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-19 14:45:57,491 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-19 14:45:57,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1662719123, now seen corresponding path program 2 times [2022-07-19 14:45:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:57,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818036840] [2022-07-19 14:45:57,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:57,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:57,817 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-19 14:45:57,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:57,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818036840] [2022-07-19 14:45:57,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818036840] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:45:57,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060810103] [2022-07-19 14:45:57,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:45:57,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:57,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:45:57,819 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-19 14:45:57,820 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-19 14:45:57,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:45:57,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:45:57,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-19 14:45:57,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:45:57,939 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-19 14:45:57,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:57,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:57,972 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-19 14:45:57,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:57,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:57,977 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-19 14:45:57,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-19 14:45:57,990 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-19 14:45:57,991 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-19 14:45:57,993 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-19 14:45:58,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:58,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:58,221 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-19 14:45:58,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:58,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:58,228 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-19 14:45:58,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:58,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:58,233 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-19 14:45:58,238 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-19 14:45:58,242 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-19 14:45:58,246 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-19 14:45:58,251 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-19 14:45:58,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:58,260 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-19 14:45:58,260 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-19 14:45:58,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:58,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:58,373 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:45:58,374 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-19 14:45:58,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:45:58,381 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:45:58,381 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-19 14:45:58,394 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-19 14:45:58,396 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-19 14:45:58,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:45:58,459 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-19 14:45:58,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:45:58,632 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-19 14:45:58,639 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-19 14:45:58,645 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-19 14:45:59,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:59,210 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-19 14:45:59,218 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 15 treesize of output 13 [2022-07-19 14:45:59,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:59,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:59,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:59,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:59,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:59,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-19 14:45:59,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060810103] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:45:59,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:45:59,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-07-19 14:45:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051328682] [2022-07-19 14:45:59,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:45:59,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-19 14:45:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:59,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-19 14:45:59,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=539, Unknown=6, NotChecked=48, Total=702 [2022-07-19 14:45:59,340 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-19 14:46:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:00,133 INFO L93 Difference]: Finished difference Result 161 states and 208 transitions. [2022-07-19 14:46:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 14:46:00,133 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-19 14:46:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:00,134 INFO L225 Difference]: With dead ends: 161 [2022-07-19 14:46:00,134 INFO L226 Difference]: Without dead ends: 159 [2022-07-19 14:46:00,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=286, Invalid=970, Unknown=8, NotChecked=68, Total=1332 [2022-07-19 14:46:00,135 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 136 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:00,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 373 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 241 Invalid, 0 Unknown, 152 Unchecked, 0.3s Time] [2022-07-19 14:46:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-19 14:46:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2022-07-19 14:46:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 137 states have internal predecessors, (179), 0 states have call successors, (0), 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-19 14:46:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2022-07-19 14:46:00,143 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 25 [2022-07-19 14:46:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:00,144 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2022-07-19 14:46:00,144 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-19 14:46:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2022-07-19 14:46:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:46:00,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:00,145 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:00,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:46:00,361 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-19 14:46:00,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:00,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash 211481171, now seen corresponding path program 3 times [2022-07-19 14:46:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:00,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173624811] [2022-07-19 14:46:00,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:00,577 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-19 14:46:00,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:00,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173624811] [2022-07-19 14:46:00,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173624811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:00,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068415932] [2022-07-19 14:46:00,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 14:46:00,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:00,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:00,579 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-19 14:46:00,582 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-19 14:46:00,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 14:46:00,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:46:00,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-19 14:46:00,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:00,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,001 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-19 14:46:01,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,006 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-19 14:46:01,011 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-19 14:46:01,015 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-19 14:46:01,019 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-19 14:46:01,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 14:46:01,026 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-19 14:46:01,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,199 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-19 14:46:01,199 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-19 14:46:01,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,209 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-19 14:46:01,215 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-19 14:46:01,220 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-19 14:46:01,225 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-19 14:46:01,229 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-19 14:46:01,236 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-19 14:46:01,236 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-19 14:46:01,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:46:01,468 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-07-19 14:46:01,468 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-19 14:46:01,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:01,482 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-19 14:46:01,483 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-19 14:46:01,489 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-19 14:46:01,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:02,064 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-19 14:46:03,699 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-19 14:46:04,175 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-19 14:46:04,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068415932] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:04,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:04,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-19 14:46:04,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058854521] [2022-07-19 14:46:04,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:04,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 14:46:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:04,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 14:46:04,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-07-19 14:46:04,177 INFO L87 Difference]: Start difference. First operand 138 states and 179 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-19 14:46:06,187 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-19 14:46:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:06,709 INFO L93 Difference]: Finished difference Result 363 states and 472 transitions. [2022-07-19 14:46:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 14:46:06,710 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-19 14:46:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:06,711 INFO L225 Difference]: With dead ends: 363 [2022-07-19 14:46:06,711 INFO L226 Difference]: Without dead ends: 241 [2022-07-19 14:46:06,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=120, Invalid=642, Unknown=2, NotChecked=106, Total=870 [2022-07-19 14:46:06,712 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 136 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:06,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 330 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2022-07-19 14:46:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-19 14:46:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 189. [2022-07-19 14:46:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.2765957446808511) internal successors, (240), 188 states have internal predecessors, (240), 0 states have call successors, (0), 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-19 14:46:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 240 transitions. [2022-07-19 14:46:06,735 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 240 transitions. Word has length 28 [2022-07-19 14:46:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:06,736 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 240 transitions. [2022-07-19 14:46:06,736 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-19 14:46:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 240 transitions. [2022-07-19 14:46:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 14:46:06,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:06,739 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-19 14:46:06,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 14:46:06,957 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-19 14:46:06,957 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:06,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1324510600, now seen corresponding path program 1 times [2022-07-19 14:46:06,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:06,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363860215] [2022-07-19 14:46:06,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:06,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:06,989 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-19 14:46:06,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:06,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363860215] [2022-07-19 14:46:06,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363860215] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:06,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272892806] [2022-07-19 14:46:06,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:06,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:06,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:07,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:46:07,013 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-19 14:46:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:07,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:46:07,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:07,142 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-19 14:46:07,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:07,166 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-19 14:46:07,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272892806] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:07,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:07,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-19 14:46:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784753876] [2022-07-19 14:46:07,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:07,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:46:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:07,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:46:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:46:07,168 INFO L87 Difference]: Start difference. First operand 189 states and 240 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-19 14:46:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:07,297 INFO L93 Difference]: Finished difference Result 634 states and 820 transitions. [2022-07-19 14:46:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 14:46:07,298 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-19 14:46:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:07,301 INFO L225 Difference]: With dead ends: 634 [2022-07-19 14:46:07,301 INFO L226 Difference]: Without dead ends: 468 [2022-07-19 14:46:07,303 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-19 14:46:07,304 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 103 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:07,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 146 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:46:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-07-19 14:46:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 397. [2022-07-19 14:46:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.255050505050505) internal successors, (497), 396 states have internal predecessors, (497), 0 states have call successors, (0), 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-19 14:46:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 497 transitions. [2022-07-19 14:46:07,336 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 497 transitions. Word has length 29 [2022-07-19 14:46:07,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:07,336 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 497 transitions. [2022-07-19 14:46:07,336 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-19 14:46:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 497 transitions. [2022-07-19 14:46:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 14:46:07,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:07,339 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-19 14:46:07,375 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-19 14:46:07,556 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-19 14:46:07,556 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash -313393350, now seen corresponding path program 1 times [2022-07-19 14:46:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:07,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98987168] [2022-07-19 14:46:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:07,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:07,787 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-19 14:46:07,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:07,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98987168] [2022-07-19 14:46:07,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98987168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:07,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927896969] [2022-07-19 14:46:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:07,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:07,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:07,796 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-19 14:46:07,797 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-19 14:46:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:07,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-19 14:46:07,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:07,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 6 treesize of output 5 [2022-07-19 14:46:07,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:07,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:07,923 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-19 14:46:07,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:07,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:07,927 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-19 14:46:07,929 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-19 14:46:07,933 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:46:07,933 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-19 14:46:07,935 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-19 14:46:08,148 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:46:08,149 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-19 14:46:08,152 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-19 14:46:08,155 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-19 14:46:08,203 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-19 14:46:08,205 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-19 14:46:08,223 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-19 14:46:08,236 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-19 14:46:08,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:08,290 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-19 14:46:08,299 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-19 14:46:08,309 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-19 14:46:08,420 INFO L356 Elim1Store]: treesize reduction 16, result has 84.9 percent of original size [2022-07-19 14:46:08,420 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-19 14:46:08,564 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-19 14:46:08,569 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-19 14:46:08,582 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-19 14:46:08,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:46:08,603 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-19 14:46:08,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927896969] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:08,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:08,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2022-07-19 14:46:08,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478076063] [2022-07-19 14:46:08,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:08,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 14:46:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:08,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 14:46:08,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=526, Unknown=5, NotChecked=250, Total=870 [2022-07-19 14:46:08,604 INFO L87 Difference]: Start difference. First operand 397 states and 497 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-19 14:46:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:09,454 INFO L93 Difference]: Finished difference Result 653 states and 819 transitions. [2022-07-19 14:46:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 14:46:09,454 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-19 14:46:09,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:09,457 INFO L225 Difference]: With dead ends: 653 [2022-07-19 14:46:09,457 INFO L226 Difference]: Without dead ends: 498 [2022-07-19 14:46:09,458 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-19 14:46:09,459 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 87 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:09,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 379 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 273 Invalid, 0 Unknown, 260 Unchecked, 0.3s Time] [2022-07-19 14:46:09,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-07-19 14:46:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 415. [2022-07-19 14:46:09,484 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-19 14:46:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 519 transitions. [2022-07-19 14:46:09,485 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 519 transitions. Word has length 29 [2022-07-19 14:46:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:09,485 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 519 transitions. [2022-07-19 14:46:09,485 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-19 14:46:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 519 transitions. [2022-07-19 14:46:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 14:46:09,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:09,486 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-19 14:46:09,517 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-19 14:46:09,699 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-19 14:46:09,700 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:09,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash -190827821, now seen corresponding path program 1 times [2022-07-19 14:46:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:09,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019788538] [2022-07-19 14:46:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:09,804 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-19 14:46:09,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:09,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019788538] [2022-07-19 14:46:09,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019788538] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:09,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716541724] [2022-07-19 14:46:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:09,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:09,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:09,806 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-19 14:46:09,807 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-19 14:46:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:09,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-19 14:46:09,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:09,920 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-19 14:46:09,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:09,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:09,942 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-19 14:46:09,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:09,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:09,947 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-19 14:46:09,950 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-19 14:46:09,953 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-19 14:46:09,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 14:46:09,956 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-19 14:46:09,960 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:46:09,960 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-19 14:46:10,052 INFO L356 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2022-07-19 14:46:10,052 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-19 14:46:10,066 INFO L356 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-07-19 14:46:10,067 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-19 14:46:10,204 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-19 14:46:10,207 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-19 14:46:10,209 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-19 14:46:10,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:10,284 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-19 14:46:10,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716541724] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:10,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:10,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 19 [2022-07-19 14:46:10,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442976179] [2022-07-19 14:46:10,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:10,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 14:46:10,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:10,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 14:46:10,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-19 14:46:10,285 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-19 14:46:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:11,503 INFO L93 Difference]: Finished difference Result 1239 states and 1598 transitions. [2022-07-19 14:46:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-19 14:46:11,503 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-19 14:46:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:11,505 INFO L225 Difference]: With dead ends: 1239 [2022-07-19 14:46:11,505 INFO L226 Difference]: Without dead ends: 805 [2022-07-19 14:46:11,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=563, Invalid=2193, Unknown=0, NotChecked=0, Total=2756 [2022-07-19 14:46:11,507 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 298 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:11,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 672 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 511 Invalid, 0 Unknown, 38 Unchecked, 0.5s Time] [2022-07-19 14:46:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-07-19 14:46:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 508. [2022-07-19 14:46:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.2978303747534516) internal successors, (658), 507 states have internal predecessors, (658), 0 states have call successors, (0), 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-19 14:46:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 658 transitions. [2022-07-19 14:46:11,568 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 658 transitions. Word has length 30 [2022-07-19 14:46:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:11,570 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 658 transitions. [2022-07-19 14:46:11,570 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-19 14:46:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 658 transitions. [2022-07-19 14:46:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 14:46:11,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:11,571 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-19 14:46:11,588 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-19 14:46:11,788 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-19 14:46:11,788 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:11,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash -583854831, now seen corresponding path program 1 times [2022-07-19 14:46:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:11,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917376356] [2022-07-19 14:46:11,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:11,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:11,824 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-19 14:46:11,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:11,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917376356] [2022-07-19 14:46:11,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917376356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:46:11,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:46:11,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:46:11,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819067885] [2022-07-19 14:46:11,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:46:11,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:46:11,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:11,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:46:11,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:46:11,825 INFO L87 Difference]: Start difference. First operand 508 states and 658 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-19 14:46:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:11,867 INFO L93 Difference]: Finished difference Result 1070 states and 1391 transitions. [2022-07-19 14:46:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:46:11,881 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-19 14:46:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:11,883 INFO L225 Difference]: With dead ends: 1070 [2022-07-19 14:46:11,883 INFO L226 Difference]: Without dead ends: 688 [2022-07-19 14:46:11,884 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-19 14:46:11,884 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-19 14:46:11,885 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-19 14:46:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-07-19 14:46:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 514. [2022-07-19 14:46:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 1.2943469785575048) internal successors, (664), 513 states have internal predecessors, (664), 0 states have call successors, (0), 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-19 14:46:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 664 transitions. [2022-07-19 14:46:11,909 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 664 transitions. Word has length 30 [2022-07-19 14:46:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:11,909 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 664 transitions. [2022-07-19 14:46:11,909 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-19 14:46:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 664 transitions. [2022-07-19 14:46:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 14:46:11,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:11,910 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-19 14:46:11,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 14:46:11,910 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:11,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:11,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1070079280, now seen corresponding path program 1 times [2022-07-19 14:46:11,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:11,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712396979] [2022-07-19 14:46:11,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:11,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:12,076 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-19 14:46:12,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:12,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712396979] [2022-07-19 14:46:12,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712396979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:12,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653923941] [2022-07-19 14:46:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:12,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:12,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:12,086 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-19 14:46:12,087 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-19 14:46:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:12,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-19 14:46:12,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:12,236 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-19 14:46:12,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:12,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:12,258 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-19 14:46:12,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:12,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:12,262 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-19 14:46:12,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:12,266 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-19 14:46:12,269 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-19 14:46:12,271 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-19 14:46:12,274 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-19 14:46:12,275 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-19 14:46:12,279 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:46:12,280 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-19 14:46:12,429 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:46:12,429 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-19 14:46:12,432 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-19 14:46:12,434 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-19 14:46:12,435 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-19 14:46:12,441 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-19 14:46:12,442 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-19 14:46:12,445 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-19 14:46:12,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:12,472 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-19 14:46:12,483 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-19 14:46:12,677 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-07-19 14:46:12,678 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 110 treesize of output 93 [2022-07-19 14:46:12,696 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-07-19 14:46:12,696 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 157 treesize of output 140 [2022-07-19 14:46:12,702 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:46:12,702 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 140 treesize of output 143 [2022-07-19 14:46:12,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:46:12,708 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 143 treesize of output 146 [2022-07-19 14:46:12,720 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 164 treesize of output 148 [2022-07-19 14:46:12,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:46:12,729 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 216 treesize of output 202 [2022-07-19 14:46:12,733 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 258 treesize of output 242 [2022-07-19 14:46:12,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:46:12,741 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 250 treesize of output 220 [2022-07-19 14:46:12,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:46:12,770 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-19 14:46:12,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653923941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:12,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:12,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-07-19 14:46:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688271826] [2022-07-19 14:46:12,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:12,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 14:46:12,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:12,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 14:46:12,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=311, Unknown=2, NotChecked=74, Total=462 [2022-07-19 14:46:12,772 INFO L87 Difference]: Start difference. First operand 514 states and 664 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-19 14:46:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:13,779 INFO L93 Difference]: Finished difference Result 1852 states and 2395 transitions. [2022-07-19 14:46:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 14:46:13,787 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-19 14:46:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:13,791 INFO L225 Difference]: With dead ends: 1852 [2022-07-19 14:46:13,792 INFO L226 Difference]: Without dead ends: 1464 [2022-07-19 14:46:13,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=484, Invalid=1244, Unknown=2, NotChecked=162, Total=1892 [2022-07-19 14:46:13,793 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 332 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:13,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 586 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 339 Invalid, 0 Unknown, 302 Unchecked, 0.4s Time] [2022-07-19 14:46:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-07-19 14:46:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 783. [2022-07-19 14:46:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.3056265984654731) internal successors, (1021), 782 states have internal predecessors, (1021), 0 states have call successors, (0), 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-19 14:46:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1021 transitions. [2022-07-19 14:46:13,840 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1021 transitions. Word has length 33 [2022-07-19 14:46:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:13,840 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1021 transitions. [2022-07-19 14:46:13,840 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-19 14:46:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1021 transitions. [2022-07-19 14:46:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 14:46:13,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:13,841 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:13,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-19 14:46:14,055 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-19 14:46:14,055 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1607684877, now seen corresponding path program 1 times [2022-07-19 14:46:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:14,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42913395] [2022-07-19 14:46:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:14,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:14,327 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-19 14:46:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:14,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42913395] [2022-07-19 14:46:14,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42913395] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:14,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936971902] [2022-07-19 14:46:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:14,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:14,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:14,344 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-19 14:46:14,345 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-19 14:46:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:14,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 123 conjunts are in the unsatisfiable core [2022-07-19 14:46:14,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:14,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-19 14:46:14,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,550 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-19 14:46:14,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,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 14 treesize of output 14 [2022-07-19 14:46:14,558 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-19 14:46:14,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,561 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-19 14:46:14,564 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-19 14:46:14,576 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-19 14:46:14,576 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-19 14:46:14,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, 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-19 14:46:14,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,794 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 65 treesize of output 59 [2022-07-19 14:46:14,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,808 INFO L356 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2022-07-19 14:46:14,808 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 71 treesize of output 66 [2022-07-19 14:46:14,812 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 60 treesize of output 49 [2022-07-19 14:46:14,815 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 52 treesize of output 43 [2022-07-19 14:46:14,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-07-19 14:46:14,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:14,829 INFO L356 Elim1Store]: treesize reduction 4, result has 84.6 percent of original size [2022-07-19 14:46:14,829 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-19 14:46:14,833 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-19 14:46:15,014 INFO L356 Elim1Store]: treesize reduction 72, result has 4.0 percent of original size [2022-07-19 14:46:15,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 83 [2022-07-19 14:46:15,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:15,022 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:46:15,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2022-07-19 14:46:15,025 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-19 14:46:15,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:15,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1251 (Array Int Int))) (or (not (< v_ArrVal_1262 |c_#StackHeapBarrier|)) (let ((.cse4 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1262 (store v_ArrVal_1255 .cse4 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1262 v_ArrVal_1255) |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_1262 v_ArrVal_1251) |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|))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| v_ArrVal_1262 (store v_ArrVal_1257 .cse4 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1262 v_ArrVal_1257) |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_1262))))) (let ((.cse1 (select (select .cse3 v_ArrVal_1262) .cse4)) (.cse2 (+ (select (select .cse0 v_ArrVal_1262) .cse4) 8))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0))))) (not (= (select |c_#valid| v_ArrVal_1262) 0)))) is different from false [2022-07-19 14:46:15,945 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-07-19 14:46:15,946 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 1152 treesize of output 1000 [2022-07-19 14:46:15,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:46:16,332 INFO L356 Elim1Store]: treesize reduction 172, result has 54.6 percent of original size [2022-07-19 14:46:16,334 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 8 new quantified variables, introduced 21 case distinctions, treesize of input 785390 treesize of output 759117 [2022-07-19 14:46:35,718 WARN L233 SmtUtils]: Spent 19.38s on a formula simplification. DAG size of input: 1586 DAG size of output: 1565 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:46:35,975 INFO L356 Elim1Store]: treesize reduction 310, result has 39.6 percent of original size [2022-07-19 14:46:35,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 701678 treesize of output 690958 [2022-07-19 14:46:42,637 WARN L233 SmtUtils]: Spent 6.66s on a formula simplification. DAG size of input: 1643 DAG size of output: 1640 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:46:42,804 INFO L356 Elim1Store]: treesize reduction 170, result has 27.0 percent of original size [2022-07-19 14:46:42,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 690386 treesize of output 675218 [2022-07-19 14:46:44,644 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:46:44,646 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 675218 treesize of output 647177 [2022-07-19 14:47:01,428 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 3182 treesize of output 3170 [2022-07-19 14:48:38,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:38,255 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 10695 treesize of output 10607 [2022-07-19 14:48:38,459 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 10675 treesize of output 10647 [2022-07-19 14:48:38,702 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 10634 treesize of output 10622 [2022-07-19 14:48:38,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:38,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 11449 treesize of output 11497 [2022-07-19 14:48:39,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:39,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11310 treesize of output 11316 [2022-07-19 14:48:39,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:39,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 12022 treesize of output 11130 [2022-07-19 14:48:40,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:40,365 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 15824 treesize of output 14120 [2022-07-19 14:48:49,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:49,162 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 1 case distinctions, treesize of input 7 treesize of output 6 [2022-07-19 14:48:49,388 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:48:49,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:49,416 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:48:49,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:49,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:49,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:48:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 9 not checked. [2022-07-19 14:48:49,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936971902] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:49,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:49,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-07-19 14:48:49,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709305432] [2022-07-19 14:48:49,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:49,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-19 14:48:49,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:49,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-19 14:48:49,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=556, Unknown=1, NotChecked=48, Total=702 [2022-07-19 14:48:49,842 INFO L87 Difference]: Start difference. First operand 783 states and 1021 transitions. Second operand has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 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-19 14:48:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:50,851 INFO L93 Difference]: Finished difference Result 1777 states and 2316 transitions. [2022-07-19 14:48:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 14:48:50,860 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 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 36 [2022-07-19 14:48:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:50,864 INFO L225 Difference]: With dead ends: 1777 [2022-07-19 14:48:50,864 INFO L226 Difference]: Without dead ends: 1087 [2022-07-19 14:48:50,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=328, Invalid=1235, Unknown=1, NotChecked=76, Total=1640 [2022-07-19 14:48:50,867 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 190 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:48:50,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 478 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 147 Invalid, 0 Unknown, 150 Unchecked, 0.3s Time] [2022-07-19 14:48:50,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2022-07-19 14:48:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 951. [2022-07-19 14:48:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 950 states have (on average 1.2936842105263158) internal successors, (1229), 950 states have internal predecessors, (1229), 0 states have call successors, (0), 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-19 14:48:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1229 transitions. [2022-07-19 14:48:50,918 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1229 transitions. Word has length 36 [2022-07-19 14:48:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:50,919 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1229 transitions. [2022-07-19 14:48:50,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 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-19 14:48:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1229 transitions. [2022-07-19 14:48:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:48:50,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:50,919 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:48:50,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 14:48:51,133 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-19 14:48:51,134 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1610537933, now seen corresponding path program 1 times [2022-07-19 14:48:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:51,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253927636] [2022-07-19 14:48:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:48:51,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:51,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253927636] [2022-07-19 14:48:51,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253927636] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:51,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686765701] [2022-07-19 14:48:51,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:51,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:51,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:51,174 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-19 14:48:51,177 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-19 14:48:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:51,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-19 14:48:51,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:51,326 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-19 14:48:51,328 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-19 14:48:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:48:51,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:48:51,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686765701] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:51,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:51,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-19 14:48:51,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023063007] [2022-07-19 14:48:51,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:51,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:48:51,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:48:51,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:48:51,362 INFO L87 Difference]: Start difference. First operand 951 states and 1229 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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-19 14:48:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:51,495 INFO L93 Difference]: Finished difference Result 1782 states and 2331 transitions. [2022-07-19 14:48:51,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:48:51,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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) Word has length 38 [2022-07-19 14:48:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:51,499 INFO L225 Difference]: With dead ends: 1782 [2022-07-19 14:48:51,499 INFO L226 Difference]: Without dead ends: 1140 [2022-07-19 14:48:51,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:48:51,500 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 79 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:48:51,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 77 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:48:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-07-19 14:48:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 886. [2022-07-19 14:48:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 1.3005649717514125) internal successors, (1151), 885 states have internal predecessors, (1151), 0 states have call successors, (0), 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-19 14:48:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1151 transitions. [2022-07-19 14:48:51,554 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1151 transitions. Word has length 38 [2022-07-19 14:48:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:51,554 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1151 transitions. [2022-07-19 14:48:51,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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-19 14:48:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1151 transitions. [2022-07-19 14:48:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 14:48:51,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:51,555 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:48:51,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:48:51,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 14:48:51,772 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:51,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:51,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1076330789, now seen corresponding path program 2 times [2022-07-19 14:48:51,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:51,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694511756] [2022-07-19 14:48:51,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:51,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:48:51,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:51,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694511756] [2022-07-19 14:48:51,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694511756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:51,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171055050] [2022-07-19 14:48:51,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:48:51,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:51,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:51,960 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:48:51,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 14:48:52,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:48:52,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:48:52,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-19 14:48:52,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:52,147 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:48:52,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:48:52,151 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 8 treesize of output 7 [2022-07-19 14:48:52,162 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-19 14:48:52,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:52,176 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 51 treesize of output 9 [2022-07-19 14:48:52,177 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-19 14:48:52,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:52,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:52,244 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 30 treesize of output 25 [2022-07-19 14:48:52,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:52,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:52,248 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-19 14:48:52,250 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 25 treesize of output 20 [2022-07-19 14:48:52,252 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-19 14:48:52,254 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-19 14:48:52,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:52,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:52,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:52,325 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 39 treesize of output 19 [2022-07-19 14:48:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:48:52,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:52,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1500 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1500 (store v_ArrVal_1498 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1500 v_ArrVal_1498) |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_1500 v_ArrVal_1499) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1500)) v_ArrVal_1500) 8) 0)) (not (< v_ArrVal_1500 |c_#StackHeapBarrier|)))) is different from false [2022-07-19 14:48:52,419 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 79 treesize of output 77 [2022-07-19 14:48:52,422 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 88 treesize of output 86 [2022-07-19 14:48:52,424 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 97 treesize of output 95 [2022-07-19 14:48:52,426 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 106 treesize of output 104 [2022-07-19 14:48:52,428 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 104 treesize of output 102 [2022-07-19 14:48:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2022-07-19 14:48:52,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171055050] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:52,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:52,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2022-07-19 14:48:52,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313147561] [2022-07-19 14:48:52,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:52,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 14:48:52,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:52,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 14:48:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2022-07-19 14:48:52,476 INFO L87 Difference]: Start difference. First operand 886 states and 1151 transitions. Second operand has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 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-19 14:48:52,538 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (and (<= 2 |c_ULTIMATE.start_main_~next_time~0#1|) (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1500 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1500 (store v_ArrVal_1498 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1500 v_ArrVal_1498) |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_1500 v_ArrVal_1499) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1500)) v_ArrVal_1500) 8) 0)) (not (< v_ArrVal_1500 |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (<= 1 (select (select |c_#memory_int| .cse0) 4)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0))) is different from false [2022-07-19 14:48:52,540 WARN L833 $PredicateComparison]: unable to prove that (and (<= 2 |c_ULTIMATE.start_main_~next_time~0#1|) (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1500 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1500 (store v_ArrVal_1498 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1500 v_ArrVal_1498) |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_1500 v_ArrVal_1499) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1500)) v_ArrVal_1500) 8) 0)) (not (< v_ArrVal_1500 |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) is different from false [2022-07-19 14:48:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:53,271 INFO L93 Difference]: Finished difference Result 1843 states and 2404 transitions. [2022-07-19 14:48:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 14:48:53,271 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 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 40 [2022-07-19 14:48:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:53,289 INFO L225 Difference]: With dead ends: 1843 [2022-07-19 14:48:53,290 INFO L226 Difference]: Without dead ends: 1010 [2022-07-19 14:48:53,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=1143, Unknown=3, NotChecked=222, Total=1640 [2022-07-19 14:48:53,292 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 273 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:48:53,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 564 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 460 Invalid, 0 Unknown, 124 Unchecked, 0.4s Time] [2022-07-19 14:48:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-07-19 14:48:53,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 875. [2022-07-19 14:48:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.3066361556064072) internal successors, (1142), 874 states have internal predecessors, (1142), 0 states have call successors, (0), 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-19 14:48:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1142 transitions. [2022-07-19 14:48:53,382 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1142 transitions. Word has length 40 [2022-07-19 14:48:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:53,383 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1142 transitions. [2022-07-19 14:48:53,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 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-19 14:48:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1142 transitions. [2022-07-19 14:48:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 14:48:53,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:53,384 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:48:53,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 14:48:53,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 14:48:53,601 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:53,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1871575436, now seen corresponding path program 2 times [2022-07-19 14:48:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:53,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314631691] [2022-07-19 14:48:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:48:53,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:53,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314631691] [2022-07-19 14:48:53,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314631691] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:53,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235948375] [2022-07-19 14:48:53,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:48:53,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:53,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:53,752 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:48:53,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 14:48:53,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:48:53,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:48:53,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-19 14:48:53,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:54,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:54,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:54,053 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-19 14:48:54,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:54,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:54,059 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-19 14:48:54,061 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-19 14:48:54,063 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-19 14:48:54,065 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-19 14:48:54,068 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-19 14:48:54,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:54,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:54,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:54,138 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 66 treesize of output 38 [2022-07-19 14:48:54,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:54,149 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:48:54,149 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 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-19 14:48:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:48:54,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:54,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1661 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (or (not (< v_ArrVal_1661 |c_#StackHeapBarrier|)) (and (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1661 (store v_ArrVal_1654 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1661 v_ArrVal_1654) |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_1661 v_ArrVal_1648) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1661)) v_ArrVal_1661) 8) 0) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1661 (store v_ArrVal_1649 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1661 v_ArrVal_1649) |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_1661 v_ArrVal_1650) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1661) 8) 0)))) is different from false [2022-07-19 14:48:54,311 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 101 treesize of output 95 [2022-07-19 14:48:54,313 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 132 treesize of output 126 [2022-07-19 14:48:54,319 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 18 treesize of output 16 [2022-07-19 14:48:54,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:54,331 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 6 treesize of output 4 [2022-07-19 14:48:54,332 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 6 treesize of output 4 [2022-07-19 14:48:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 9 not checked. [2022-07-19 14:48:54,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235948375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:54,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:54,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-07-19 14:48:54,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746154098] [2022-07-19 14:48:54,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:54,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 14:48:54,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:54,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 14:48:54,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=217, Unknown=1, NotChecked=30, Total=306 [2022-07-19 14:48:54,421 INFO L87 Difference]: Start difference. First operand 875 states and 1142 transitions. Second operand has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:48:54,460 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1661 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (or (not (< v_ArrVal_1661 |c_#StackHeapBarrier|)) (and (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1661 (store v_ArrVal_1654 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1661 v_ArrVal_1654) |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_1661 v_ArrVal_1648) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1661)) v_ArrVal_1661) 8) 0) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1661 (store v_ArrVal_1649 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1661 v_ArrVal_1649) |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_1661 v_ArrVal_1650) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1661) 8) 0)))) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| 0) (= .cse0 |c_ULTIMATE.start_check_queue_~n~0#1.offset|) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| .cse1) (= |c_ULTIMATE.start_check_queue_~n~0#1.offset| 0) (= .cse0 0) (= .cse1 0))) is different from false [2022-07-19 14:48:54,463 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1661 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (or (not (< v_ArrVal_1661 |c_#StackHeapBarrier|)) (and (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1661 (store v_ArrVal_1654 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1661 v_ArrVal_1654) |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_1661 v_ArrVal_1648) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1661)) v_ArrVal_1661) 8) 0) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1661 (store v_ArrVal_1649 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1661 v_ArrVal_1649) |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_1661 v_ArrVal_1650) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1661) 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-19 14:48:54,586 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1661 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (or (not (< v_ArrVal_1661 |c_#StackHeapBarrier|)) (and (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1661 (store v_ArrVal_1654 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1661 v_ArrVal_1654) |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_1661 v_ArrVal_1648) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1661)) v_ArrVal_1661) 8) 0) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1661 (store v_ArrVal_1649 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1661 v_ArrVal_1649) |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_1661 v_ArrVal_1650) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1661) 8) 0)))) (= |c_ULTIMATE.start_choose_next_~q#1.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| 0) (= .cse0 |c_ULTIMATE.start_check_queue_~n~0#1.offset|) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| .cse1) (= |c_ULTIMATE.start_check_queue_~n~0#1.offset| 0) (= .cse0 0) (= .cse1 0))) is different from false [2022-07-19 14:48:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:54,733 INFO L93 Difference]: Finished difference Result 2579 states and 3382 transitions. [2022-07-19 14:48:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 14:48:54,734 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-19 14:48:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:54,739 INFO L225 Difference]: With dead ends: 2579 [2022-07-19 14:48:54,739 INFO L226 Difference]: Without dead ends: 1986 [2022-07-19 14:48:54,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=401, Unknown=4, NotChecked=180, Total=702 [2022-07-19 14:48:54,740 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 109 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:48:54,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 325 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 132 Unchecked, 0.1s Time] [2022-07-19 14:48:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2022-07-19 14:48:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1614. [2022-07-19 14:48:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1613 states have (on average 1.3025418474891506) internal successors, (2101), 1613 states have internal predecessors, (2101), 0 states have call successors, (0), 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-19 14:48:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2101 transitions. [2022-07-19 14:48:54,833 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2101 transitions. Word has length 41 [2022-07-19 14:48:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:54,834 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 2101 transitions. [2022-07-19 14:48:54,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:48:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2101 transitions. [2022-07-19 14:48:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 14:48:54,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:54,834 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-07-19 14:48:54,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 14:48:55,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 14:48:55,048 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2115090350, now seen corresponding path program 4 times [2022-07-19 14:48:55,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:55,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455342295] [2022-07-19 14:48:55,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:48:55,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455342295] [2022-07-19 14:48:55,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455342295] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826241497] [2022-07-19 14:48:55,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 14:48:55,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:55,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:55,491 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:48:55,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 14:48:55,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 14:48:55,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:48:55,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 204 conjunts are in the unsatisfiable core [2022-07-19 14:48:55,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:55,686 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-19 14:48:55,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:55,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:55,728 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-19 14:48:55,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:55,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:55,733 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-19 14:48:55,736 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-19 14:48:55,749 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-19 14:48:55,749 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-19 14:48:55,752 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-19 14:48:56,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,032 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-19 14:48:56,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-19 14:48:56,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,050 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-19 14:48:56,054 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 37 treesize of output 30 [2022-07-19 14:48:56,058 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 32 [2022-07-19 14:48:56,066 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-19 14:48:56,070 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-19 14:48:56,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,083 INFO L356 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2022-07-19 14:48:56,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2022-07-19 14:48:56,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,448 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 42 treesize of output 40 [2022-07-19 14:48:56,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,463 INFO L356 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2022-07-19 14:48:56,463 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 109 treesize of output 84 [2022-07-19 14:48:56,468 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 90 treesize of output 71 [2022-07-19 14:48:56,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2022-07-19 14:48:56,480 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 30 treesize of output 25 [2022-07-19 14:48:56,486 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-19 14:48:56,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,500 INFO L356 Elim1Store]: treesize reduction 8, result has 86.0 percent of original size [2022-07-19 14:48:56,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 61 [2022-07-19 14:48:56,504 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-19 14:48:56,755 INFO L356 Elim1Store]: treesize reduction 72, result has 4.0 percent of original size [2022-07-19 14:48:56,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 272 treesize of output 100 [2022-07-19 14:48:56,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:56,763 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:48:56,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2022-07-19 14:48:56,775 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-19 14:48:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:48:56,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:56,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1904 Int) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_19| Int) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1908 (Array Int Int)) (v_ArrVal_1906 (Array Int Int))) (or (<= 1 (let ((.cse4 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_19| 8))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1904 (store v_ArrVal_1906 .cse4 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1904 v_ArrVal_1906) |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_1904 v_ArrVal_1900) |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_19|))) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.base| v_ArrVal_1904 (store v_ArrVal_1895 .cse4 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1904 v_ArrVal_1895) |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_1904))))) (let ((.cse1 (select (select .cse0 v_ArrVal_1904) .cse4)) (.cse2 (+ 8 (select (select .cse3 v_ArrVal_1904) .cse4)))) (select (select (store (store |c_#memory_int| v_ArrVal_1904 v_ArrVal_1909) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1908) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) (not (= (select |c_#valid| v_ArrVal_1904) 0)) (not (< v_ArrVal_1904 |c_#StackHeapBarrier|)))) is different from false [2022-07-19 14:48:57,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1891 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_19| Int) (v_ArrVal_1892 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1908 (Array Int Int)) (v_ArrVal_1906 (Array Int Int))) (or (<= 1 (let ((.cse4 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_19| 8))) (let ((.cse3 (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1892 (store v_ArrVal_1889 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1892 v_ArrVal_1889) |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_1892 v_ArrVal_1886) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse8 v_ArrVal_1904 (store v_ArrVal_1906 .cse4 (select (select (store .cse8 v_ArrVal_1904 v_ArrVal_1906) |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 .cse8 v_ArrVal_1904 v_ArrVal_1900) |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_19|)))) (.cse0 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| v_ArrVal_1892 (store v_ArrVal_1879 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1892 v_ArrVal_1879) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse7 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1892))))) (store .cse6 v_ArrVal_1904 (store v_ArrVal_1895 .cse4 (select (select (store .cse6 v_ArrVal_1904 v_ArrVal_1895) |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_1904))))) (let ((.cse1 (select (select .cse0 v_ArrVal_1904) .cse4)) (.cse2 (+ 8 (select (select .cse3 v_ArrVal_1904) .cse4)))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_1892 v_ArrVal_1876) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1891) v_ArrVal_1904 v_ArrVal_1909) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1908) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) (not (= (select |c_#valid| v_ArrVal_1892) 0)) (not (< v_ArrVal_1892 |c_#StackHeapBarrier|)) (not (< v_ArrVal_1904 |c_#StackHeapBarrier|)) (not (= (select (store |c_#valid| v_ArrVal_1892 1) v_ArrVal_1904) 0)))) is different from false [2022-07-19 14:48:57,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:57,807 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 347775 treesize of output 334908 [2022-07-19 14:48:57,872 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 334038 treesize of output 283862 [2022-07-19 14:48:57,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 283862 treesize of output 271318 [2022-07-19 14:48:57,979 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 271318 treesize of output 246230 [2022-07-19 14:48:58,031 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 246230 treesize of output 239958 [2022-07-19 14:49:44,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:44,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:45,701 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:45,731 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 4037797222 treesize of output 4005668930