./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina2.c -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 1ea1eb4a8af9eb0da04a9f2b25d1b98ecd98ff3b6d87ba0d8e53000f12b8adcc --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:32:42,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:32:42,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:32:42,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:32:42,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:32:42,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:32:42,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:32:42,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:32:42,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:32:42,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:32:42,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:32:42,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:32:42,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:32:42,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:32:42,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:32:42,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:32:42,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:32:42,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:32:42,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:32:42,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:32:42,701 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:32:42,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:32:42,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:32:42,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:32:42,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:32:42,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:32:42,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:32:42,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:32:42,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:32:42,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:32:42,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:32:42,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:32:42,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:32:42,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:32:42,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:32:42,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:32:42,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:32:42,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:32:42,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:32:42,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:32:42,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:32:42,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:32:42,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:32:42,736 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:32:42,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:32:42,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:32:42,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:32:42,737 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:32:42,737 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:32:42,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:32:42,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:32:42,738 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:32:42,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:32:42,739 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:32:42,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:32:42,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:32:42,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:32:42,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:32:42,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:32:42,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:32:42,740 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:32:42,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:32:42,740 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:32:42,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:32:42,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:32:42,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:32:42,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:32:42,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:32:42,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:32:42,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:32:42,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:32:42,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:32:42,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:32:42,742 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:32:42,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:32:42,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:32:42,742 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 -> 1ea1eb4a8af9eb0da04a9f2b25d1b98ecd98ff3b6d87ba0d8e53000f12b8adcc [2022-07-11 23:32:42,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:32:42,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:32:42,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:32:42,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:32:42,937 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:32:42,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina2.c [2022-07-11 23:32:42,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb03cb26/51029c63c6c44a82bd5f85745e208bd0/FLAGdf0a737ca [2022-07-11 23:32:43,323 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:32:43,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina2.c [2022-07-11 23:32:43,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb03cb26/51029c63c6c44a82bd5f85745e208bd0/FLAGdf0a737ca [2022-07-11 23:32:43,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb03cb26/51029c63c6c44a82bd5f85745e208bd0 [2022-07-11 23:32:43,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:32:43,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:32:43,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:32:43,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:32:43,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:32:43,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e93620f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43, skipping insertion in model container [2022-07-11 23:32:43,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:32:43,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:32:43,444 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/array-fpi/sina2.c[588,601] [2022-07-11 23:32:43,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:32:43,467 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:32:43,478 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/array-fpi/sina2.c[588,601] [2022-07-11 23:32:43,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:32:43,504 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:32:43,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43 WrapperNode [2022-07-11 23:32:43,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:32:43,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:32:43,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:32:43,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:32:43,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,538 INFO L137 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2022-07-11 23:32:43,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:32:43,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:32:43,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:32:43,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:32:43,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:32:43,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:32:43,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:32:43,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:32:43,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (1/1) ... [2022-07-11 23:32:43,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:32:43,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:43,596 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-11 23:32:43,597 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-11 23:32:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:32:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:32:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:32:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:32:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:32:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:32:43,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:32:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:32:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:32:43,673 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:32:43,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:32:43,752 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:32:43,756 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:32:43,756 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-11 23:32:43,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:32:43 BoogieIcfgContainer [2022-07-11 23:32:43,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:32:43,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:32:43,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:32:43,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:32:43,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:32:43" (1/3) ... [2022-07-11 23:32:43,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca01cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:32:43, skipping insertion in model container [2022-07-11 23:32:43,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:32:43" (2/3) ... [2022-07-11 23:32:43,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca01cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:32:43, skipping insertion in model container [2022-07-11 23:32:43,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:32:43" (3/3) ... [2022-07-11 23:32:43,773 INFO L111 eAbstractionObserver]: Analyzing ICFG sina2.c [2022-07-11 23:32:43,782 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:32:43,783 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:32:43,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:32:43,840 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@3a09517c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@78d7399b [2022-07-11 23:32:43,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:32:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-11 23:32:43,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:43,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:43,849 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2022-07-11 23:32:43,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:43,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252354260] [2022-07-11 23:32:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:43,935 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-11 23:32:43,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:43,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252354260] [2022-07-11 23:32:43,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252354260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:32:43,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:32:43,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:32:43,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910619342] [2022-07-11 23:32:43,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:32:43,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:32:43,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:43,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:32:43,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:32:43,980 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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-11 23:32:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:43,998 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-07-11 23:32:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:32:44,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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-11 23:32:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:44,005 INFO L225 Difference]: With dead ends: 44 [2022-07-11 23:32:44,005 INFO L226 Difference]: Without dead ends: 20 [2022-07-11 23:32:44,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:32:44,012 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:44,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:32:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-11 23:32:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-11 23:32:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 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-11 23:32:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-11 23:32:44,031 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-07-11 23:32:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:44,031 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-11 23:32:44,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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-11 23:32:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-11 23:32:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-11 23:32:44,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:44,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:44,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:32:44,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2022-07-11 23:32:44,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:44,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070194262] [2022-07-11 23:32:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:44,142 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-11 23:32:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:44,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070194262] [2022-07-11 23:32:44,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070194262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:32:44,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:32:44,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:32:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248913625] [2022-07-11 23:32:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:32:44,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:32:44,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:44,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:32:44,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:32:44,145 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-11 23:32:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:44,182 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-11 23:32:44,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:32:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-11 23:32:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:44,184 INFO L225 Difference]: With dead ends: 45 [2022-07-11 23:32:44,184 INFO L226 Difference]: Without dead ends: 32 [2022-07-11 23:32:44,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:32:44,185 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:44,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:32:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-11 23:32:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-07-11 23:32:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 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-11 23:32:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-11 23:32:44,190 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-07-11 23:32:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:44,190 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-11 23:32:44,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-11 23:32:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-11 23:32:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:32:44,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:44,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:44,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:32:44,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2022-07-11 23:32:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:44,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454823402] [2022-07-11 23:32:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:44,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:44,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454823402] [2022-07-11 23:32:44,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454823402] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:44,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808791142] [2022-07-11 23:32:44,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:44,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:44,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:44,622 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-11 23:32:44,627 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-11 23:32:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:44,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-11 23:32:44,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:44,730 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-11 23:32:44,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:32:44,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:32:44,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-11 23:32:44,948 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 36 treesize of output 23 [2022-07-11 23:32:45,071 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 51 treesize of output 31 [2022-07-11 23:32:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:45,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:45,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:32:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:45,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808791142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:45,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:45,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 28 [2022-07-11 23:32:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955324254] [2022-07-11 23:32:45,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:45,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-11 23:32:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:45,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-11 23:32:45,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2022-07-11 23:32:45,311 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:45,511 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-07-11 23:32:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 23:32:45,511 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-11 23:32:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:45,512 INFO L225 Difference]: With dead ends: 45 [2022-07-11 23:32:45,512 INFO L226 Difference]: Without dead ends: 43 [2022-07-11 23:32:45,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-07-11 23:32:45,513 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:45,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 210 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-07-11 23:32:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-11 23:32:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2022-07-11 23:32:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 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-11 23:32:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-11 23:32:45,518 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 20 [2022-07-11 23:32:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:45,518 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-11 23:32:45,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-11 23:32:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:32:45,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:45,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:45,537 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-11 23:32:45,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:45,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:45,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash 859342364, now seen corresponding path program 2 times [2022-07-11 23:32:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:45,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762113488] [2022-07-11 23:32:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:32:45,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762113488] [2022-07-11 23:32:45,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762113488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:45,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895012096] [2022-07-11 23:32:45,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:32:45,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:45,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:45,774 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-11 23:32:45,775 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-11 23:32:45,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:32:45,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:32:45,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:32:45,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:32:45,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:32:45,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895012096] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:45,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:45,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:32:45,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056887184] [2022-07-11 23:32:45,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:45,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:32:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:32:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:32:45,879 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:45,969 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-07-11 23:32:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:32:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-11 23:32:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:45,970 INFO L225 Difference]: With dead ends: 81 [2022-07-11 23:32:45,970 INFO L226 Difference]: Without dead ends: 54 [2022-07-11 23:32:45,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:32:45,971 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:45,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 61 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:32:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-11 23:32:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2022-07-11 23:32:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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-11 23:32:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-11 23:32:45,976 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2022-07-11 23:32:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:45,976 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-11 23:32:45,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-11 23:32:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:32:45,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:45,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:45,995 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-11 23:32:46,191 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,SelfDestructingSolverStorable3 [2022-07-11 23:32:46,191 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash 803751580, now seen corresponding path program 3 times [2022-07-11 23:32:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:46,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430471136] [2022-07-11 23:32:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:32:46,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:46,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430471136] [2022-07-11 23:32:46,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430471136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:46,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990541752] [2022-07-11 23:32:46,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:32:46,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:46,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:46,250 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-11 23:32:46,251 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-11 23:32:46,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:32:46,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:32:46,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:32:46,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:32:46,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:32:46,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990541752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:46,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:46,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:32:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018762515] [2022-07-11 23:32:46,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:46,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:32:46,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:46,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:32:46,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:32:46,351 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 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-11 23:32:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:32:46,455 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-07-11 23:32:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:32:46,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 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 22 [2022-07-11 23:32:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:32:46,456 INFO L225 Difference]: With dead ends: 52 [2022-07-11 23:32:46,456 INFO L226 Difference]: Without dead ends: 43 [2022-07-11 23:32:46,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:32:46,457 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:32:46,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 45 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:32:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-11 23:32:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-07-11 23:32:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:32:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-11 23:32:46,461 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2022-07-11 23:32:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:32:46,461 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-11 23:32:46,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 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-11 23:32:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-07-11 23:32:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:32:46,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:32:46,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:46,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-11 23:32:46,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:46,663 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1304966232, now seen corresponding path program 4 times [2022-07-11 23:32:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:46,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431247946] [2022-07-11 23:32:46,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:46,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:47,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:47,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431247946] [2022-07-11 23:32:47,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431247946] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:47,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393532899] [2022-07-11 23:32:47,325 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:32:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:47,326 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-11 23:32:47,327 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-11 23:32:47,371 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:32:47,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:32:47,372 WARN L261 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-11 23:32:47,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:47,384 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-11 23:32:47,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:32:47,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-11 23:32:47,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:32:47,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-11 23:32:47,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-07-11 23:32:47,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:32:47,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-07-11 23:32:47,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:47,905 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-11 23:32:47,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-07-11 23:32:48,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:48,017 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 45 treesize of output 29 [2022-07-11 23:32:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:48,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:50,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (or (forall ((v_ArrVal_160 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_160) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_57|)))) is different from false [2022-07-11 23:33:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-11 23:33:00,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393532899] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:00,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:00,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 51 [2022-07-11 23:33:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252936054] [2022-07-11 23:33:00,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:00,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-11 23:33:00,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:00,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-11 23:33:00,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2193, Unknown=15, NotChecked=96, Total=2550 [2022-07-11 23:33:00,409 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 51 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:03,169 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse8 (= (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8)) 0)) (.cse11 (select .cse0 0))) (let ((.cse6 (+ c_~N~0 1)) (.cse3 (= .cse11 1)) (.cse1 (+ c_~N~0 .cse11)) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (not .cse8)) (.cse7 (select .cse0 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (or (let ((.cse2 (+ .cse4 1))) (and (<= .cse1 .cse2) .cse3 (<= .cse2 .cse1))) .cse5) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= .cse6 .cse7) (forall ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (or (forall ((v_ArrVal_160 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_160) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_57|)))) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse7 .cse6) (or (and (<= 2 c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) .cse8) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))) (or (let ((.cse9 (+ .cse4 2))) (and (= .cse7 1) .cse3 (<= .cse1 .cse9) (<= .cse9 .cse1))) .cse5) (= (+ (- 2) .cse7) 1))))) is different from false [2022-07-11 23:33:05,215 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ (- 2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= c_~N~0 2) (forall ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (or (forall ((v_ArrVal_160 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_160) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_57|)))) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-11 23:33:05,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:05,327 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-07-11 23:33:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-11 23:33:05,328 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-11 23:33:05,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:05,328 INFO L225 Difference]: With dead ends: 58 [2022-07-11 23:33:05,328 INFO L226 Difference]: Without dead ends: 56 [2022-07-11 23:33:05,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=311, Invalid=2875, Unknown=18, NotChecked=336, Total=3540 [2022-07-11 23:33:05,330 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:05,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 148 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 286 Invalid, 0 Unknown, 360 Unchecked, 0.2s Time] [2022-07-11 23:33:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-11 23:33:05,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2022-07-11 23:33:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 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-11 23:33:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-11 23:33:05,335 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 26 [2022-07-11 23:33:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:05,335 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-11 23:33:05,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-11 23:33:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:33:05,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:05,336 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:05,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:33:05,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:05,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1135931414, now seen corresponding path program 5 times [2022-07-11 23:33:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:05,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424309006] [2022-07-11 23:33:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:33:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:05,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424309006] [2022-07-11 23:33:05,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424309006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:05,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796583294] [2022-07-11 23:33:05,603 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:33:05,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:05,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:05,604 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-11 23:33:05,605 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-11 23:33:05,653 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 23:33:05,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:05,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:33:05,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:33:05,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:33:05,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796583294] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:05,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:05,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:33:05,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776993197] [2022-07-11 23:33:05,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:05,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:33:05,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:05,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:33:05,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:33:05,724 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 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-11 23:33:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:05,835 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-07-11 23:33:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:33:05,835 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 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-11 23:33:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:05,836 INFO L225 Difference]: With dead ends: 112 [2022-07-11 23:33:05,836 INFO L226 Difference]: Without dead ends: 89 [2022-07-11 23:33:05,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:33:05,837 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:05,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 72 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:33:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-11 23:33:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2022-07-11 23:33:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 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-11 23:33:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-07-11 23:33:05,844 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 28 [2022-07-11 23:33:05,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:05,844 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-07-11 23:33:05,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 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-11 23:33:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-07-11 23:33:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:33:05,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:05,845 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:05,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-11 23:33:06,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:06,060 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash -227434410, now seen corresponding path program 6 times [2022-07-11 23:33:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:06,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965178246] [2022-07-11 23:33:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:06,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:33:06,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:06,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965178246] [2022-07-11 23:33:06,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965178246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:06,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173256183] [2022-07-11 23:33:06,115 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:33:06,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:06,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:06,116 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-11 23:33:06,117 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-11 23:33:06,166 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-11 23:33:06,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:06,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:33:06,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:33:06,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:33:06,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173256183] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:06,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:06,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:33:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763596487] [2022-07-11 23:33:06,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:06,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:33:06,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:06,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:33:06,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:33:06,263 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:06,405 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-07-11 23:33:06,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:33:06,406 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-11 23:33:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:06,406 INFO L225 Difference]: With dead ends: 91 [2022-07-11 23:33:06,406 INFO L226 Difference]: Without dead ends: 76 [2022-07-11 23:33:06,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:33:06,407 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 108 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:06,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 105 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:33:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-11 23:33:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2022-07-11 23:33:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-07-11 23:33:06,412 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 28 [2022-07-11 23:33:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:06,413 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-07-11 23:33:06,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-07-11 23:33:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:33:06,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:06,414 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] [2022-07-11 23:33:06,429 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-11 23:33:06,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:06,621 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:06,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash 341343694, now seen corresponding path program 1 times [2022-07-11 23:33:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:06,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819875831] [2022-07-11 23:33:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:06,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:07,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:07,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819875831] [2022-07-11 23:33:07,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819875831] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:07,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169649203] [2022-07-11 23:33:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:07,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:07,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:07,211 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-11 23:33:07,212 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-11 23:33:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:07,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-11 23:33:07,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:07,279 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-11 23:33:07,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:07,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:33:07,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:07,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:07,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-11 23:33:07,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:07,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:07,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:07,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-11 23:33:07,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:07,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:07,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-07-11 23:33:07,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:07,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:07,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:07,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2022-07-11 23:33:07,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:07,809 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 42 treesize of output 25 [2022-07-11 23:33:08,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:08,006 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 51 treesize of output 31 [2022-07-11 23:33:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:08,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:10,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169649203] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:10,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:10,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 53 [2022-07-11 23:33:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903778740] [2022-07-11 23:33:10,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:10,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-11 23:33:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:10,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-11 23:33:10,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2487, Unknown=1, NotChecked=0, Total=2756 [2022-07-11 23:33:10,022 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 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-11 23:33:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:10,929 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-07-11 23:33:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-11 23:33:10,930 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 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-11 23:33:10,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:10,930 INFO L225 Difference]: With dead ends: 57 [2022-07-11 23:33:10,930 INFO L226 Difference]: Without dead ends: 36 [2022-07-11 23:33:10,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=339, Invalid=3200, Unknown=1, NotChecked=0, Total=3540 [2022-07-11 23:33:10,932 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:10,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 154 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 252 Invalid, 0 Unknown, 212 Unchecked, 0.2s Time] [2022-07-11 23:33:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-11 23:33:10,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-07-11 23:33:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 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-11 23:33:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-11 23:33:10,935 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 30 [2022-07-11 23:33:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:10,935 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-11 23:33:10,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 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-11 23:33:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-11 23:33:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:33:10,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:10,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:10,959 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-11 23:33:11,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:11,151 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1505554158, now seen corresponding path program 7 times [2022-07-11 23:33:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:11,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177500658] [2022-07-11 23:33:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:12,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:12,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177500658] [2022-07-11 23:33:12,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177500658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:12,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680353163] [2022-07-11 23:33:12,036 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:33:12,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:12,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:12,037 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-11 23:33:12,038 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-11 23:33:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:12,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-11 23:33:12,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:12,098 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-11 23:33:12,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:33:12,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:33:12,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-11 23:33:12,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-07-11 23:33:12,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:12,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-07-11 23:33:12,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:12,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-07-11 23:33:12,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:12,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2022-07-11 23:33:12,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:12,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2022-07-11 23:33:12,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:12,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-07-11 23:33:12,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:12,825 INFO L356 Elim1Store]: treesize reduction 30, result has 42.3 percent of original size [2022-07-11 23:33:12,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 57 [2022-07-11 23:33:12,947 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 43 treesize of output 27 [2022-07-11 23:33:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:12,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:15,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) is different from false [2022-07-11 23:33:15,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_367 Int) (v_ArrVal_365 Int) (|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_365) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) is different from false [2022-07-11 23:33:33,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:33,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:33,876 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-11 23:33:33,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 1 [2022-07-11 23:33:33,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:33,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:33,883 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-11 23:33:33,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 1 [2022-07-11 23:33:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-11 23:33:33,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680353163] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:33,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:33,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 60 [2022-07-11 23:33:33,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038527517] [2022-07-11 23:33:33,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:33,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-11 23:33:33,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:33,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-11 23:33:33,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2998, Unknown=30, NotChecked=226, Total=3540 [2022-07-11 23:33:33,887 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 60 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 23:33:36,159 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (+ c_~N~0 1)) (.cse2 (select .cse1 0))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) (not (<= (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 7)) (= (select .cse1 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse1 (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 4) (<= .cse2 .cse3) (<= 3 c_~N~0) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (<= .cse3 .cse2) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)))) is different from false [2022-07-11 23:33:38,253 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) (forall ((v_ArrVal_367 Int) (v_ArrVal_365 Int) (|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_120|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_365) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) (<= 3 c_~N~0) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (= 4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-11 23:33:40,860 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) (forall ((v_ArrVal_367 Int) (v_ArrVal_365 Int) (|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_120|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_365) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) is different from false [2022-07-11 23:33:41,222 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (forall ((v_ArrVal_367 Int) (v_ArrVal_365 Int) (|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_365) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) is different from false [2022-07-11 23:33:43,224 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ c_~N~0 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_367 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_120|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) is different from false [2022-07-11 23:33:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:43,284 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-07-11 23:33:43,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-11 23:33:43,284 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 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 32 [2022-07-11 23:33:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:43,284 INFO L225 Difference]: With dead ends: 70 [2022-07-11 23:33:43,284 INFO L226 Difference]: Without dead ends: 68 [2022-07-11 23:33:43,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=360, Invalid=3539, Unknown=35, NotChecked=896, Total=4830 [2022-07-11 23:33:43,286 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:43,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 164 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 235 Invalid, 0 Unknown, 363 Unchecked, 0.1s Time] [2022-07-11 23:33:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-11 23:33:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2022-07-11 23:33:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-07-11 23:33:43,291 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 32 [2022-07-11 23:33:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:43,291 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-07-11 23:33:43,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 23:33:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-07-11 23:33:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:33:43,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:43,292 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:43,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:33:43,508 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,SelfDestructingSolverStorable9 [2022-07-11 23:33:43,509 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2062841424, now seen corresponding path program 8 times [2022-07-11 23:33:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:43,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515442366] [2022-07-11 23:33:43,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:43,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:33:43,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:43,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515442366] [2022-07-11 23:33:43,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515442366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:43,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807441113] [2022-07-11 23:33:43,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:33:43,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:43,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:43,574 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-11 23:33:43,587 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-11 23:33:43,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:33:43,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:43,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:33:43,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:33:43,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:33:43,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807441113] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:43,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:43,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:33:43,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945403786] [2022-07-11 23:33:43,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:43,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:33:43,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:43,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:33:43,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:33:43,746 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 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-11 23:33:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:43,873 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2022-07-11 23:33:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:33:43,874 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 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 34 [2022-07-11 23:33:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:43,874 INFO L225 Difference]: With dead ends: 142 [2022-07-11 23:33:43,874 INFO L226 Difference]: Without dead ends: 113 [2022-07-11 23:33:43,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-11 23:33:43,875 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 152 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:43,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 80 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:33:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-11 23:33:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 79. [2022-07-11 23:33:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.1153846153846154) internal successors, (87), 78 states have internal predecessors, (87), 0 states have call successors, (0), 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-11 23:33:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-07-11 23:33:43,884 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 34 [2022-07-11 23:33:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:43,884 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-07-11 23:33:43,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 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-11 23:33:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-07-11 23:33:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:33:43,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:43,884 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:43,913 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-11 23:33:44,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:44,101 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:44,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:44,101 INFO L85 PathProgramCache]: Analyzing trace with hash 526321296, now seen corresponding path program 9 times [2022-07-11 23:33:44,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:44,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143315326] [2022-07-11 23:33:44,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:44,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:33:44,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:44,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143315326] [2022-07-11 23:33:44,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143315326] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:44,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544146343] [2022-07-11 23:33:44,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:33:44,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:44,180 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-11 23:33:44,206 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-11 23:33:44,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:33:44,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:44,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:33:44,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:33:44,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:33:44,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544146343] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:44,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:44,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:33:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697368632] [2022-07-11 23:33:44,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:44,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:33:44,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:44,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:33:44,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:33:44,346 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 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-11 23:33:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:44,550 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-07-11 23:33:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:33:44,550 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 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 34 [2022-07-11 23:33:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:44,551 INFO L225 Difference]: With dead ends: 119 [2022-07-11 23:33:44,551 INFO L226 Difference]: Without dead ends: 98 [2022-07-11 23:33:44,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:33:44,552 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 150 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:44,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 145 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:33:44,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-11 23:33:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2022-07-11 23:33:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 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-11 23:33:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-07-11 23:33:44,557 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2022-07-11 23:33:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:44,557 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-07-11 23:33:44,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 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-11 23:33:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-07-11 23:33:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:33:44,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:44,558 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:44,577 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-11 23:33:44,767 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,SelfDestructingSolverStorable11 [2022-07-11 23:33:44,767 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -968725112, now seen corresponding path program 2 times [2022-07-11 23:33:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:44,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221948512] [2022-07-11 23:33:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:33:45,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:45,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221948512] [2022-07-11 23:33:45,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221948512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040032217] [2022-07-11 23:33:45,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:33:45,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:45,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:45,900 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-11 23:33:45,900 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-11 23:33:45,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:33:45,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:45,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-11 23:33:45,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:45,964 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-11 23:33:45,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-11 23:33:46,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:33:46,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-11 23:33:46,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-11 23:33:46,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-11 23:33:46,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-11 23:33:46,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:46,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-07-11 23:33:46,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:46,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2022-07-11 23:33:46,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:33:46,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2022-07-11 23:33:46,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 27 [2022-07-11 23:33:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:33:46,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:34:13,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-11 23:34:14,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-11 23:34:14,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (let ((.cse0 (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (+ .cse5 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (let ((.cse4 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse3 .cse4 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 .cse4)))))) (store .cse1 .cse2 (+ (select .cse3 .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-11 23:34:23,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:34:23,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 150 [2022-07-11 23:34:23,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (+ (select .cse3 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-11 23:34:23,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (+ (select .cse3 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-11 23:34:23,284 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_187| Int)) (or (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (+ (select .cse3 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 .cse1)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_187|)))) is different from false [2022-07-11 23:34:23,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (|v_ULTIMATE.start_main_~i~0#1_187| Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse1)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 .cse1)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_187|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-11 23:34:23,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (|v_ULTIMATE.start_main_~i~0#1_187| Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_187|)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (+ (select .cse3 .cse1) (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) is different from false [2022-07-11 23:34:23,341 INFO L356 Elim1Store]: treesize reduction 127, result has 23.0 percent of original size [2022-07-11 23:34:23,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 475 treesize of output 189 [2022-07-11 23:34:23,346 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 391 treesize of output 355 [2022-07-11 23:34:23,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:23,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:23,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:23,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:23,449 INFO L356 Elim1Store]: treesize reduction 29, result has 74.8 percent of original size [2022-07-11 23:34:23,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 101 treesize of output 151 [2022-07-11 23:34:23,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:23,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:23,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:23,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:23,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:34:23,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 112 [2022-07-11 23:34:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2022-07-11 23:34:23,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040032217] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:34:23,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:34:23,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 21] total 63 [2022-07-11 23:34:23,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329426103] [2022-07-11 23:34:23,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:34:23,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-11 23:34:23,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:34:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-11 23:34:23,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2657, Unknown=21, NotChecked=904, Total=3906 [2022-07-11 23:34:23,662 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 63 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 0 states have call successors, (0), 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-11 23:34:23,704 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= .cse2 0) (or (<= (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* c_~N~0 8)) (let ((.cse5 (select .cse0 0))) (let ((.cse4 (+ .cse2 1)) (.cse3 (+ c_~N~0 .cse5))) (and (<= .cse3 .cse4) (= .cse5 1) (= (select .cse0 8) 1) (<= .cse4 .cse3))))) (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (|v_ULTIMATE.start_main_~i~0#1_187| Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_187|)) (let ((.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (store (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse8 .cse7 (+ (select .cse9 .cse7) (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse6 .cse7) (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-11 23:34:23,708 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (<= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 7)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (|v_ULTIMATE.start_main_~i~0#1_187| Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse1)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse0 .cse1)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_187|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-11 23:34:25,712 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 .cse1) 1) (= (select .cse0 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (<= .cse1 7)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_187| Int)) (or (forall ((v_ArrVal_544 Int) (|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_534 Int)) (or (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_187|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_534)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse4 .cse3 (+ (select .cse5 .cse3) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_179|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_544))) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 .cse3)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_187|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-11 23:34:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:34:34,014 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-07-11 23:34:34,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-11 23:34:34,015 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 0 states have call successors, (0), 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-11 23:34:34,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:34:34,015 INFO L225 Difference]: With dead ends: 71 [2022-07-11 23:34:34,015 INFO L226 Difference]: Without dead ends: 69 [2022-07-11 23:34:34,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 36 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=558, Invalid=4718, Unknown=24, NotChecked=1672, Total=6972 [2022-07-11 23:34:34,017 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:34:34,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 157 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 381 Invalid, 0 Unknown, 427 Unchecked, 0.2s Time] [2022-07-11 23:34:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-11 23:34:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-07-11 23:34:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:34:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-07-11 23:34:34,022 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 36 [2022-07-11 23:34:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:34:34,023 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-07-11 23:34:34,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 0 states have call successors, (0), 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-11 23:34:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-07-11 23:34:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-11 23:34:34,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:34:34,023 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:34:34,047 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-11 23:34:34,224 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,SelfDestructingSolverStorable12 [2022-07-11 23:34:34,224 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:34:34,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:34:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash -389301684, now seen corresponding path program 10 times [2022-07-11 23:34:34,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:34:34,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857299204] [2022-07-11 23:34:34,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:34:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:34:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:34:35,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:34:35,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857299204] [2022-07-11 23:34:35,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857299204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:34:35,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996809074] [2022-07-11 23:34:35,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:34:35,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:35,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:34:35,556 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-11 23:34:35,557 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-11 23:34:35,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:34:35,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:34:35,620 WARN L261 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-11 23:34:35,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:34:35,639 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-11 23:34:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:34:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-11 23:34:35,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-11 23:34:35,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-07-11 23:34:36,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:36,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-07-11 23:34:36,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:36,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2022-07-11 23:34:36,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:36,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2022-07-11 23:34:36,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2022-07-11 23:34:36,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:36,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-07-11 23:34:36,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:36,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2022-07-11 23:34:36,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:36,944 INFO L356 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2022-07-11 23:34:36,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 68 [2022-07-11 23:34:37,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:37,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:37,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:37,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:37,098 INFO L356 Elim1Store]: treesize reduction 78, result has 29.1 percent of original size [2022-07-11 23:34:37,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 71 [2022-07-11 23:34:37,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:37,264 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 43 treesize of output 27 [2022-07-11 23:34:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:34:37,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:34:39,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_202|)) (forall ((v_ArrVal_632 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) is different from false [2022-07-11 23:34:39,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_202|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) is different from false [2022-07-11 23:34:41,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_203| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_203|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_203| 1) |v_ULTIMATE.start_main_~i~0#1_202|)))))) is different from false [2022-07-11 23:34:43,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_628 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_203|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_628) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_203| 1) |v_ULTIMATE.start_main_~i~0#1_202|)))) is different from false [2022-07-11 23:34:45,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_628 Int)) (or (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_628) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_203|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_203| 1) |v_ULTIMATE.start_main_~i~0#1_202|)))) is different from false [2022-07-11 23:36:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-11 23:36:18,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996809074] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:36:18,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:36:18,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 85 [2022-07-11 23:36:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854850854] [2022-07-11 23:36:18,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:36:18,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-07-11 23:36:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:36:18,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-07-11 23:36:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=5839, Unknown=51, NotChecked=800, Total=7140 [2022-07-11 23:36:18,993 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 85 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 85 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-11 23:36:33,725 WARN L233 SmtUtils]: Spent 11.54s on a formula simplification. DAG size of input: 94 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:36:37,752 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ c_~N~0 1)) (.cse1 (select .cse0 0))) (and (= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) (<= c_~N~0 4) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 1 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_628 Int)) (or (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_628) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_203|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_203| 1) |v_ULTIMATE.start_main_~i~0#1_202|)))) (<= .cse1 .cse2) (= (select .cse0 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 4))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_203| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_203|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_203| 1) |v_ULTIMATE.start_main_~i~0#1_202|)))))) (<= .cse2 .cse1) (< 3 c_~N~0) (= 5 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-07-11 23:36:38,254 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (+ c_~N~0 1)) (.cse1 (select .cse0 0))) (and (<= c_~N~0 4) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_202|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= 1 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (<= .cse1 .cse2) (= (select .cse0 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 4))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) 2) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int) (|v_ULTIMATE.start_main_~i~0#1_203| Int) (v_ArrVal_628 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_203|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_628) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_203| 1) |v_ULTIMATE.start_main_~i~0#1_202|)))) (<= .cse2 .cse1) (< 3 c_~N~0) (= 5 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-11 23:36:40,264 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (+ c_~N~0 1)) (.cse2 (select .cse1 0))) (and (<= c_~N~0 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_202|)) (forall ((v_ArrVal_632 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (= .cse0 24) (= 1 (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= .cse2 .cse3) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 4))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) 2) |c_ULTIMATE.start_main_~i~0#1|) (or (= (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= .cse0 16)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_203| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_203|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_203|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_203| 1) |v_ULTIMATE.start_main_~i~0#1_202|)))))) (<= .cse3 .cse2) (< 3 c_~N~0) (= 5 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-11 23:36:40,676 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (+ c_~N~0 1)) (.cse0 (select .cse2 0))) (and (not (= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= c_~N~0 4) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int) (v_ArrVal_632 Int) (v_ArrVal_630 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_202|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_630) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) (<= .cse0 .cse1) (or (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (= 1 (select .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)))) (and (= (select .cse2 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 4))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse1 .cse0) (< 3 c_~N~0) (= 5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-11 23:36:42,692 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~N~0 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_202| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_202|)) (forall ((v_ArrVal_632 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_202|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_632) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 4))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 3 c_~N~0) (= 5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-11 23:36:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:36:42,988 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-07-11 23:36:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-11 23:36:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 85 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 38 [2022-07-11 23:36:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:36:42,989 INFO L225 Difference]: With dead ends: 107 [2022-07-11 23:36:42,989 INFO L226 Difference]: Without dead ends: 105 [2022-07-11 23:36:42,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 126.6s TimeCoverageRelationStatistics Valid=560, Invalid=7253, Unknown=59, NotChecked=1830, Total=9702 [2022-07-11 23:36:42,992 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1347 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:36:42,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 299 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 512 Invalid, 0 Unknown, 1347 Unchecked, 0.3s Time] [2022-07-11 23:36:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-11 23:36:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2022-07-11 23:36:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 94 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-11 23:36:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-07-11 23:36:43,001 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 38 [2022-07-11 23:36:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:36:43,001 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-07-11 23:36:43,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 85 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-11 23:36:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-07-11 23:36:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-11 23:36:43,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:36:43,002 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:36:43,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-11 23:36:43,204 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,SelfDestructingSolverStorable13 [2022-07-11 23:36:43,205 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:36:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:36:43,205 INFO L85 PathProgramCache]: Analyzing trace with hash -441278722, now seen corresponding path program 3 times [2022-07-11 23:36:43,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:36:43,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787750646] [2022-07-11 23:36:43,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:36:43,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:36:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:36:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:36:43,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:36:43,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787750646] [2022-07-11 23:36:43,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787750646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:36:43,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445419464] [2022-07-11 23:36:43,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:36:43,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:36:43,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:36:43,993 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-11 23:36:43,994 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-11 23:36:44,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-11 23:36:44,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:36:44,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-11 23:36:44,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:36:44,098 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 15 treesize of output 11 [2022-07-11 23:36:44,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:44,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:36:44,188 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-11 23:36:44,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:36:44,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:44,347 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 25 treesize of output 25 [2022-07-11 23:36:44,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:44,403 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 25 treesize of output 25 [2022-07-11 23:36:44,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:44,464 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:36:44,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-11 23:36:44,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:44,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:36:44,634 INFO L356 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2022-07-11 23:36:44,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 46 [2022-07-11 23:36:44,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:44,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:44,781 INFO L356 Elim1Store]: treesize reduction 39, result has 30.4 percent of original size [2022-07-11 23:36:44,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 66 [2022-07-11 23:36:44,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:44,909 INFO L356 Elim1Store]: treesize reduction 68, result has 44.7 percent of original size [2022-07-11 23:36:44,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 107 [2022-07-11 23:36:46,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:46,774 INFO L356 Elim1Store]: treesize reduction 73, result has 36.5 percent of original size [2022-07-11 23:36:46,775 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 145 treesize of output 116 [2022-07-11 23:36:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:36:46,851 INFO L328 TraceCheckSpWp]: Computing backward predicates...