./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ifeqn5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/ifeqn5.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 2e5b1d71ba93ce7431f315c72529ea116ea643f5eb9195d392455a202e45b249 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:05:33,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:05:33,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:05:33,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:05:33,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:05:33,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:05:33,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:05:33,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:05:33,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:05:33,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:05:33,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:05:33,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:05:33,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:05:33,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:05:33,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:05:33,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:05:33,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:05:33,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:05:33,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:05:33,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:05:33,819 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:05:33,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:05:33,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:05:33,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:05:33,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:05:33,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:05:33,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:05:33,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:05:33,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:05:33,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:05:33,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:05:33,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:05:33,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:05:33,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:05:33,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:05:33,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:05:33,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:05:33,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:05:33,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:05:33,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:05:33,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:05:33,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:05:33,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:05:33,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:05:33,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:05:33,871 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:05:33,872 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:05:33,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:05:33,872 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:05:33,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:05:33,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:05:33,873 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:05:33,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:05:33,873 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:05:33,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:05:33,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:05:33,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:05:33,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:05:33,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:05:33,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:05:33,875 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:05:33,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:05:33,875 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:05:33,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:05:33,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:05:33,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:05:33,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:05:33,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:05:33,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:05:33,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:05:33,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:05:33,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:05:33,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:05:33,877 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:05:33,877 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:05:33,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:05:33,877 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 -> 2e5b1d71ba93ce7431f315c72529ea116ea643f5eb9195d392455a202e45b249 [2022-07-20 22:05:34,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:05:34,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:05:34,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:05:34,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:05:34,101 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:05:34,101 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ifeqn5.c [2022-07-20 22:05:34,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b201d78/d8c5009bffbf4b87b22514db724a7321/FLAG8d8863638 [2022-07-20 22:05:34,550 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:05:34,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn5.c [2022-07-20 22:05:34,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b201d78/d8c5009bffbf4b87b22514db724a7321/FLAG8d8863638 [2022-07-20 22:05:34,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b201d78/d8c5009bffbf4b87b22514db724a7321 [2022-07-20 22:05:34,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:05:34,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:05:34,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:05:34,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:05:34,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:05:34,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ef638e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34, skipping insertion in model container [2022-07-20 22:05:34,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:05:34,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:05:34,717 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/ifeqn5.c[589,602] [2022-07-20 22:05:34,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:05:34,736 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:05:34,744 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/ifeqn5.c[589,602] [2022-07-20 22:05:34,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:05:34,771 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:05:34,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34 WrapperNode [2022-07-20 22:05:34,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:05:34,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:05:34,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:05:34,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:05:34,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,806 INFO L137 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-07-20 22:05:34,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:05:34,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:05:34,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:05:34,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:05:34,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:05:34,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:05:34,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:05:34,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:05:34,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (1/1) ... [2022-07-20 22:05:34,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:05:34,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:05:34,861 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-20 22:05:34,863 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-20 22:05:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:05:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:05:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 22:05:34,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:05:34,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:05:34,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:05:34,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 22:05:34,981 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:05:34,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:05:35,169 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:05:35,173 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:05:35,191 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 22:05:35,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:05:35 BoogieIcfgContainer [2022-07-20 22:05:35,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:05:35,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:05:35,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:05:35,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:05:35,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:05:34" (1/3) ... [2022-07-20 22:05:35,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7287a88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:05:35, skipping insertion in model container [2022-07-20 22:05:35,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:05:34" (2/3) ... [2022-07-20 22:05:35,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7287a88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:05:35, skipping insertion in model container [2022-07-20 22:05:35,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:05:35" (3/3) ... [2022-07-20 22:05:35,199 INFO L111 eAbstractionObserver]: Analyzing ICFG ifeqn5.c [2022-07-20 22:05:35,208 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:05:35,210 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:05:35,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:05:35,257 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@19cf96e9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4620a5e4 [2022-07-20 22:05:35,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:05:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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-20 22:05:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 22:05:35,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:05:35,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:05:35,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:05:35,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:05:35,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1670316217, now seen corresponding path program 1 times [2022-07-20 22:05:35,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:05:35,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112272829] [2022-07-20 22:05:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:05:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:05:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:05:35,403 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-20 22:05:35,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:05:35,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112272829] [2022-07-20 22:05:35,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112272829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:05:35,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:05:35,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 22:05:35,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808941304] [2022-07-20 22:05:35,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:05:35,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 22:05:35,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:05:35,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 22:05:35,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 22:05:35,433 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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-20 22:05:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:05:35,446 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-07-20 22:05:35,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 22:05:35,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-20 22:05:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:05:35,453 INFO L225 Difference]: With dead ends: 42 [2022-07-20 22:05:35,454 INFO L226 Difference]: Without dead ends: 19 [2022-07-20 22:05:35,459 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-20 22:05:35,463 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-20 22:05:35,464 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-20 22:05:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-20 22:05:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-20 22:05:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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-20 22:05:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-20 22:05:35,486 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-07-20 22:05:35,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:05:35,487 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-20 22:05:35,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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-20 22:05:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-20 22:05:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 22:05:35,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:05:35,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:05:35,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:05:35,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:05:35,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:05:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1000416578, now seen corresponding path program 1 times [2022-07-20 22:05:35,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:05:35,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395139103] [2022-07-20 22:05:35,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:05:35,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:05:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:05:35,582 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-20 22:05:35,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:05:35,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395139103] [2022-07-20 22:05:35,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395139103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:05:35,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:05:35,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:05:35,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135628146] [2022-07-20 22:05:35,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:05:35,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:05:35,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:05:35,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:05:35,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:05:35,585 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-20 22:05:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:05:35,644 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-07-20 22:05:35,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:05:35,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-20 22:05:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:05:35,646 INFO L225 Difference]: With dead ends: 45 [2022-07-20 22:05:35,646 INFO L226 Difference]: Without dead ends: 31 [2022-07-20 22:05:35,646 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-20 22:05:35,647 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:05:35,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 17 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:05:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-20 22:05:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-07-20 22:05:35,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:05:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-20 22:05:35,656 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2022-07-20 22:05:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:05:35,657 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-20 22:05:35,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-20 22:05:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-20 22:05:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 22:05:35,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:05:35,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:05:35,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:05:35,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:05:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:05:35,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1992201947, now seen corresponding path program 1 times [2022-07-20 22:05:35,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:05:35,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621815940] [2022-07-20 22:05:35,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:05:35,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:05:35,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:05:35,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651541472] [2022-07-20 22:05:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:05:35,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:05:35,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:05:35,700 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-20 22:05:35,701 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-20 22:05:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:05:35,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 22:05:35,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:05:35,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 22:05:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 22:05:35,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:05:35,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:05:35,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621815940] [2022-07-20 22:05:35,826 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:05:35,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651541472] [2022-07-20 22:05:35,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651541472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:05:35,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:05:35,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:05:35,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693455207] [2022-07-20 22:05:35,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:05:35,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:05:35,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:05:35,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:05:35,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:05:35,829 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 22:05:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:05:35,869 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-07-20 22:05:35,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:05:35,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 22:05:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:05:35,870 INFO L225 Difference]: With dead ends: 40 [2022-07-20 22:05:35,871 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 22:05:35,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:05:35,872 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:05:35,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:05:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 22:05:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-07-20 22:05:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 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-20 22:05:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-20 22:05:35,876 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-07-20 22:05:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:05:35,876 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-20 22:05:35,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 22:05:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-20 22:05:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 22:05:35,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:05:35,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:05:35,897 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-20 22:05:36,099 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-20 22:05:36,099 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:05:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:05:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash 259417010, now seen corresponding path program 1 times [2022-07-20 22:05:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:05:36,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934337410] [2022-07-20 22:05:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:05:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:05:36,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:05:36,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923705096] [2022-07-20 22:05:36,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:05:36,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:05:36,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:05:36,128 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-20 22:05:36,129 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-20 22:05:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:05:36,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:05:36,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:05:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:05:36,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:05:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:05:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:05:36,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934337410] [2022-07-20 22:05:36,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:05:36,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923705096] [2022-07-20 22:05:36,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923705096] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:05:36,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:05:36,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-20 22:05:36,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334996965] [2022-07-20 22:05:36,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:05:36,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:05:36,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:05:36,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:05:36,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:05:36,297 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-20 22:05:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:05:36,442 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-07-20 22:05:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:05:36,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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) Word has length 21 [2022-07-20 22:05:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:05:36,444 INFO L225 Difference]: With dead ends: 70 [2022-07-20 22:05:36,444 INFO L226 Difference]: Without dead ends: 43 [2022-07-20 22:05:36,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:05:36,445 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:05:36,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:05:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-20 22:05:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-07-20 22:05:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 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-20 22:05:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-20 22:05:36,450 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2022-07-20 22:05:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:05:36,450 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-20 22:05:36,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-20 22:05:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-20 22:05:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 22:05:36,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:05:36,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:05:36,468 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-20 22:05:36,667 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-20 22:05:36,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:05:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:05:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash 939318754, now seen corresponding path program 1 times [2022-07-20 22:05:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:05:36,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181023302] [2022-07-20 22:05:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:05:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:05:36,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:05:36,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708864353] [2022-07-20 22:05:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:05:36,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:05:36,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:05:36,693 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-20 22:05:36,694 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-20 22:05:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:05:36,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 22:05:36,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:05:36,796 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-20 22:05:36,852 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 22:05:36,853 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 21 treesize of output 20 [2022-07-20 22:05:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 22:05:36,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:05:37,091 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 21 treesize of output 19 [2022-07-20 22:05:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 22:05:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:05:37,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181023302] [2022-07-20 22:05:37,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:05:37,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708864353] [2022-07-20 22:05:37,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708864353] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:05:37,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:05:37,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2022-07-20 22:05:37,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98122602] [2022-07-20 22:05:37,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:05:37,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:05:37,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:05:37,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:05:37,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:05:37,124 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-20 22:05:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:05:37,252 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-07-20 22:05:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 22:05:37,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 22:05:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:05:37,253 INFO L225 Difference]: With dead ends: 73 [2022-07-20 22:05:37,253 INFO L226 Difference]: Without dead ends: 61 [2022-07-20 22:05:37,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:05:37,254 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:05:37,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 71 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 80 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-07-20 22:05:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-20 22:05:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2022-07-20 22:05:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 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-20 22:05:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-07-20 22:05:37,264 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2022-07-20 22:05:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:05:37,265 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-07-20 22:05:37,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-20 22:05:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-07-20 22:05:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 22:05:37,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:05:37,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:05:37,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 22:05:37,483 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-20 22:05:37,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:05:37,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:05:37,485 INFO L85 PathProgramCache]: Analyzing trace with hash 430403928, now seen corresponding path program 1 times [2022-07-20 22:05:37,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:05:37,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257848651] [2022-07-20 22:05:37,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:05:37,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:05:37,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:05:37,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048418004] [2022-07-20 22:05:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:05:37,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:05:37,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:05:37,525 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-20 22:05:37,560 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-20 22:05:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:05:37,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-20 22:05:37,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:05:37,705 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-20 22:05:37,728 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-20 22:05:37,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:05:37,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 22:05:37,831 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 19 treesize of output 18 [2022-07-20 22:05:37,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:05:37,891 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 22:05:37,891 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 38 treesize of output 32 [2022-07-20 22:05:38,064 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 22:05:38,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2022-07-20 22:05:38,073 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-20 22:05:38,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:05:38,711 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-20 22:05:38,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:05:38,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257848651] [2022-07-20 22:05:38,712 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:05:38,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048418004] [2022-07-20 22:05:38,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048418004] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:05:38,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:05:38,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-07-20 22:05:38,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261266524] [2022-07-20 22:05:38,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:05:38,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 22:05:38,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:05:38,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 22:05:38,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-07-20 22:05:38,713 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 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-20 22:06:16,827 WARN L233 SmtUtils]: Spent 36.91s on a formula simplification. DAG size of input: 89 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 22:06:29,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 22:06:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:06:30,049 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2022-07-20 22:06:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 22:06:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 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-20 22:06:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:06:30,051 INFO L225 Difference]: With dead ends: 124 [2022-07-20 22:06:30,051 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 22:06:30,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 22:06:30,052 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:06:30,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 76 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 220 Invalid, 1 Unknown, 77 Unchecked, 12.9s Time] [2022-07-20 22:06:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 22:06:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2022-07-20 22:06:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:06:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-07-20 22:06:30,066 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 28 [2022-07-20 22:06:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:06:30,066 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-07-20 22:06:30,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 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-20 22:06:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-07-20 22:06:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 22:06:30,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:06:30,068 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:06:30,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-20 22:06:30,284 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-20 22:06:30,285 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:06:30,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:06:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash -849177916, now seen corresponding path program 2 times [2022-07-20 22:06:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:06:30,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490278512] [2022-07-20 22:06:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:06:30,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:06:30,314 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:06:30,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673111608] [2022-07-20 22:06:30,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:06:30,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:06:30,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:06:30,316 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-20 22:06:30,318 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-20 22:06:30,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:06:30,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:06:30,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 22:06:30,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:06:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 22:06:30,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:06:30,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:06:30,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490278512] [2022-07-20 22:06:30,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:06:30,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673111608] [2022-07-20 22:06:30,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673111608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:06:30,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:06:30,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:06:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921070309] [2022-07-20 22:06:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:06:30,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:06:30,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:06:30,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:06:30,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:06:30,397 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:06:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:06:30,443 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2022-07-20 22:06:30,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 22:06:30,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 22:06:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:06:30,444 INFO L225 Difference]: With dead ends: 121 [2022-07-20 22:06:30,444 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 22:06:30,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:06:30,445 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:06:30,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:06:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 22:06:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-07-20 22:06:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:06:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2022-07-20 22:06:30,452 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 30 [2022-07-20 22:06:30,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:06:30,452 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2022-07-20 22:06:30,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:06:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2022-07-20 22:06:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 22:06:30,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:06:30,453 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:06:30,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 22:06:30,669 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-20 22:06:30,672 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:06:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:06:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1242204926, now seen corresponding path program 3 times [2022-07-20 22:06:30,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:06:30,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88926287] [2022-07-20 22:06:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:06:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:06:30,708 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:06:30,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744829011] [2022-07-20 22:06:30,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:06:30,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:06:30,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:06:30,720 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-20 22:06:30,721 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-20 22:06:30,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 22:06:30,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:06:30,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 22:06:30,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:06:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 22:06:30,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:06:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 22:06:31,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:06:31,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88926287] [2022-07-20 22:06:31,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:06:31,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744829011] [2022-07-20 22:06:31,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744829011] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:06:31,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:06:31,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-07-20 22:06:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804322106] [2022-07-20 22:06:31,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:06:31,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:06:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:06:31,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:06:31,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:06:31,030 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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-20 22:06:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:06:31,249 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-07-20 22:06:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 22:06:31,250 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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 30 [2022-07-20 22:06:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:06:31,251 INFO L225 Difference]: With dead ends: 133 [2022-07-20 22:06:31,251 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 22:06:31,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2022-07-20 22:06:31,252 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 251 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:06:31,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 103 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:06:31,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 22:06:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2022-07-20 22:06:31,258 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-20 22:06:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-07-20 22:06:31,258 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 30 [2022-07-20 22:06:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:06:31,258 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-07-20 22:06:31,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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-20 22:06:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-07-20 22:06:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 22:06:31,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:06:31,263 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:06:31,283 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-20 22:06:31,473 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-20 22:06:31,473 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:06:31,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:06:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash 877615566, now seen corresponding path program 2 times [2022-07-20 22:06:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:06:31,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875377183] [2022-07-20 22:06:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:06:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:06:31,486 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:06:31,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428786770] [2022-07-20 22:06:31,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:06:31,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:06:31,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:06:31,499 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-20 22:06:31,500 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-20 22:06:31,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:06:31,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:06:31,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:06:31,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:06:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 22:06:31,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:06:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 22:06:31,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:06:31,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875377183] [2022-07-20 22:06:31,685 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:06:31,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428786770] [2022-07-20 22:06:31,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428786770] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:06:31,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:06:31,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-20 22:06:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600803164] [2022-07-20 22:06:31,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:06:31,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 22:06:31,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:06:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 22:06:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:06:31,687 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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-20 22:06:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:06:31,812 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-07-20 22:06:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:06:31,812 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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-20 22:06:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:06:31,813 INFO L225 Difference]: With dead ends: 102 [2022-07-20 22:06:31,813 INFO L226 Difference]: Without dead ends: 77 [2022-07-20 22:06:31,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-20 22:06:31,814 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:06:31,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 66 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:06:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-20 22:06:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2022-07-20 22:06:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 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-20 22:06:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-07-20 22:06:31,823 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 32 [2022-07-20 22:06:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:06:31,823 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-07-20 22:06:31,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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-20 22:06:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-07-20 22:06:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 22:06:31,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:06:31,825 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:06:31,857 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-20 22:06:32,035 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-20 22:06:32,036 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:06:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:06:32,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1847758638, now seen corresponding path program 4 times [2022-07-20 22:06:32,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:06:32,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401273027] [2022-07-20 22:06:32,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:06:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:06:32,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:06:32,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432256235] [2022-07-20 22:06:32,060 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:06:32,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:06:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:06:32,078 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-20 22:06:32,093 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-20 22:06:32,131 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:06:32,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:06:32,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:06:32,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:06:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:06:32,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:06:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:06:32,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:06:32,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401273027] [2022-07-20 22:06:32,272 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:06:32,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432256235] [2022-07-20 22:06:32,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432256235] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:06:32,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:06:32,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-07-20 22:06:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633226443] [2022-07-20 22:06:32,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:06:32,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 22:06:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:06:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 22:06:32,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-20 22:06:32,276 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 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-20 22:06:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:06:32,460 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-07-20 22:06:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 22:06:32,460 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 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 33 [2022-07-20 22:06:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:06:32,461 INFO L225 Difference]: With dead ends: 116 [2022-07-20 22:06:32,461 INFO L226 Difference]: Without dead ends: 103 [2022-07-20 22:06:32,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-20 22:06:32,462 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 129 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:06:32,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 115 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:06:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-20 22:06:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2022-07-20 22:06:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 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-20 22:06:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-07-20 22:06:32,468 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 33 [2022-07-20 22:06:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:06:32,468 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-07-20 22:06:32,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 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-20 22:06:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-07-20 22:06:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:06:32,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:06:32,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:06:32,486 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-20 22:06:32,679 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-20 22:06:32,679 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:06:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:06:32,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1646708229, now seen corresponding path program 3 times [2022-07-20 22:06:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:06:32,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703362487] [2022-07-20 22:06:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:06:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:06:32,692 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:06:32,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474157024] [2022-07-20 22:06:32,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:06:32,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:06:32,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:06:32,694 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-20 22:06:32,695 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-20 22:06:32,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 22:06:32,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:06:32,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 22:06:32,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:06:32,967 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-20 22:06:33,001 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-20 22:06:33,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,070 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 25 treesize of output 24 [2022-07-20 22:06:33,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,154 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 25 treesize of output 24 [2022-07-20 22:06:33,267 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 19 treesize of output 18 [2022-07-20 22:06:33,360 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 22:06:33,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 127 [2022-07-20 22:06:33,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:06:33,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 194 [2022-07-20 22:06:33,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 64 [2022-07-20 22:06:33,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:06:33,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:06:33,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:33,584 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-20 22:06:33,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 75 [2022-07-20 22:06:33,835 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 22:06:33,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 32 [2022-07-20 22:06:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:06:33,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:06:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:06:35,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:06:35,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703362487] [2022-07-20 22:06:35,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:06:35,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474157024] [2022-07-20 22:06:35,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474157024] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:06:35,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:06:35,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-07-20 22:06:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567384131] [2022-07-20 22:06:35,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:06:35,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 22:06:35,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:06:35,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 22:06:35,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1246, Unknown=0, NotChecked=0, Total=1560 [2022-07-20 22:06:35,477 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:06:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:06:36,537 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-07-20 22:06:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-20 22:06:36,538 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 22:06:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:06:36,538 INFO L225 Difference]: With dead ends: 97 [2022-07-20 22:06:36,539 INFO L226 Difference]: Without dead ends: 95 [2022-07-20 22:06:36,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=528, Invalid=2228, Unknown=0, NotChecked=0, Total=2756 [2022-07-20 22:06:36,540 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:06:36,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 93 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 172 Invalid, 0 Unknown, 276 Unchecked, 0.3s Time] [2022-07-20 22:06:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-20 22:06:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2022-07-20 22:06:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 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-20 22:06:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-07-20 22:06:36,554 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 34 [2022-07-20 22:06:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:06:36,555 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-07-20 22:06:36,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:06:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-07-20 22:06:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:06:36,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:06:36,572 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:06:36,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-20 22:06:36,772 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-20 22:06:36,772 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:06:36,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:06:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash -653025448, now seen corresponding path program 4 times [2022-07-20 22:06:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:06:36,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484139479] [2022-07-20 22:06:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:06:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:06:36,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:06:36,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93861931] [2022-07-20 22:06:36,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:06:36,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:06:36,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:06:36,798 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-20 22:06:36,799 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-20 22:06:36,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:06:36,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:06:36,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 22:06:36,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:06:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:06:36,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:06:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:06:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:06:36,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484139479] [2022-07-20 22:06:36,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:06:36,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93861931] [2022-07-20 22:06:36,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93861931] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:06:36,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:06:36,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-20 22:06:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147163295] [2022-07-20 22:06:36,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:06:36,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 22:06:36,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:06:36,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 22:06:36,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-07-20 22:06:36,987 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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-20 22:06:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:06:37,256 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-07-20 22:06:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 22:06:37,257 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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-20 22:06:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:06:37,257 INFO L225 Difference]: With dead ends: 120 [2022-07-20 22:06:37,257 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 22:06:37,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-07-20 22:06:37,258 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 156 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:06:37,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 111 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 22:06:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 22:06:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2022-07-20 22:06:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:06:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-07-20 22:06:37,265 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 34 [2022-07-20 22:06:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:06:37,265 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-07-20 22:06:37,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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-20 22:06:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-07-20 22:06:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 22:06:37,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:06:37,266 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:06:37,291 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-20 22:06:37,466 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-20 22:06:37,467 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:06:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:06:37,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1259217666, now seen corresponding path program 5 times [2022-07-20 22:06:37,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:06:37,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596873709] [2022-07-20 22:06:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:06:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:06:37,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:06:37,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488613273] [2022-07-20 22:06:37,499 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 22:06:37,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:06:37,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:06:37,503 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-20 22:06:37,504 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-20 22:06:38,752 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-20 22:06:38,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:06:38,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-20 22:06:38,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:06:38,764 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-20 22:06:38,780 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-20 22:06:38,821 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 110 treesize of output 99 [2022-07-20 22:06:38,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:06:38,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2022-07-20 22:06:38,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 47 [2022-07-20 22:06:38,945 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 125 treesize of output 110 [2022-07-20 22:06:38,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:06:38,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 187 [2022-07-20 22:06:38,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:38,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 88 [2022-07-20 22:06:39,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2022-07-20 22:06:39,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,151 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 51 treesize of output 46 [2022-07-20 22:06:39,233 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 22:06:39,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 154 [2022-07-20 22:06:39,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:06:39,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 197 [2022-07-20 22:06:39,399 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 22:06:39,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 156 [2022-07-20 22:06:39,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:06:39,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 213 [2022-07-20 22:06:39,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 63 [2022-07-20 22:06:39,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:06:39,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:06:39,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:06:39,585 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-20 22:06:39,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 82 [2022-07-20 22:06:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:06:39,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:07:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 22:07:06,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:07:06,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596873709] [2022-07-20 22:07:06,298 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:07:06,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488613273] [2022-07-20 22:07:06,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488613273] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:07:06,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:07:06,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 27 [2022-07-20 22:07:06,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917348601] [2022-07-20 22:07:06,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:07:06,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 22:07:06,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:07:06,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 22:07:06,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=559, Unknown=1, NotChecked=0, Total=702 [2022-07-20 22:07:06,300 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 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-20 22:07:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:07:15,108 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-07-20 22:07:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 22:07:15,109 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 22:07:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:07:15,109 INFO L225 Difference]: With dead ends: 96 [2022-07-20 22:07:15,109 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 22:07:15,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=199, Invalid=856, Unknown=1, NotChecked=0, Total=1056 [2022-07-20 22:07:15,110 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:07:15,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 68 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 219 Invalid, 0 Unknown, 104 Unchecked, 0.2s Time] [2022-07-20 22:07:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 22:07:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-07-20 22:07:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 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-20 22:07:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-07-20 22:07:15,118 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 36 [2022-07-20 22:07:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:07:15,119 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-07-20 22:07:15,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 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-20 22:07:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-07-20 22:07:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 22:07:15,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:07:15,119 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:07:15,129 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-20 22:07:15,319 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-20 22:07:15,320 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:07:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:07:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1129715953, now seen corresponding path program 5 times [2022-07-20 22:07:15,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:07:15,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726814708] [2022-07-20 22:07:15,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:07:15,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:07:15,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:07:15,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740429608] [2022-07-20 22:07:15,330 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 22:07:15,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:07:15,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:07:15,336 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-20 22:07:15,337 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-20 22:07:15,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-20 22:07:15,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:07:15,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-20 22:07:15,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:07:15,776 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-20 22:07:15,783 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-20 22:07:15,817 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 110 treesize of output 99 [2022-07-20 22:07:15,858 INFO L356 Elim1Store]: treesize reduction 364, result has 5.9 percent of original size [2022-07-20 22:07:15,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 140 [2022-07-20 22:07:15,877 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-20 22:07:15,936 INFO L356 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-07-20 22:07:15,937 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 3 case distinctions, treesize of input 36 treesize of output 34 [2022-07-20 22:07:15,971 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 22:07:15,971 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 34 treesize of output 32 [2022-07-20 22:07:16,021 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 151 treesize of output 137 [2022-07-20 22:07:16,064 INFO L356 Elim1Store]: treesize reduction 356, result has 8.0 percent of original size [2022-07-20 22:07:16,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 123 treesize of output 173 [2022-07-20 22:07:16,169 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-20 22:07:16,169 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 4 case distinctions, treesize of input 70 treesize of output 58 [2022-07-20 22:07:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:07:16,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:07:58,861 WARN L233 SmtUtils]: Spent 15.24s on a formula simplification. DAG size of input: 55 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 22:07:59,824 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse1 (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|) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse0 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or (not (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse3 (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|) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse5 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5)))) 30)))) is different from false [2022-07-20 22:08:02,593 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (.cse0 (<= (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse15 (not .cse0)) (.cse1 (not .cse10))) (and (or (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse10))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse13)))) 30)) .cse15)) (not (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))) (or (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse19 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse19 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse17 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse18 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse18)))) 30)) .cse10) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse23 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse23 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse22 (store (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| .cse22) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse22 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse20 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse1)) .cse15) (or (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse27 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse27 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse26 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse24 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) 30)) .cse10) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse31 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse31 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse29 (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse29 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse30 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse30)))))) .cse1)) .cse0)))) is different from false [2022-07-20 22:08:04,606 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse10 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (.cse0 (<= (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse15 (not .cse0)) (.cse1 (not .cse10))) (and (or (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse10))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse13)))) 30)) .cse15)) (not (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))) (or (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse19 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse19 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse17 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse18 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse18)))) 30)) .cse10) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse23 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse23 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse22 (store (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| .cse22) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse22 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse20 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse1)) .cse15) (or (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse27 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse27 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse26 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse24 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) 30)) .cse10) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse31 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse31 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse29 (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse29 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse30 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse30)))))) .cse1)) .cse0)))) is different from true [2022-07-20 22:08:07,029 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (let ((.cse15 (not .cse0)) (.cse10 (not .cse1))) (and (or (not (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647)) (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse9 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse10))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse13 (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse11 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) 30)) .cse15))) (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse19 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse19 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse17 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse18 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse18)))) 30))) (or .cse10 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse23 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse23 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse21 (store (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~b~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse21 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse22 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse22)))) 30))))) (or .cse15 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse27 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse27 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse25 (store (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse26 (select (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse25 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse26 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse26))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse31 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse31 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse29 (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse29 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse30 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse30)))))) .cse10)))))) is different from false [2022-07-20 22:08:09,044 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (let ((.cse15 (not .cse0)) (.cse10 (not .cse1))) (and (or (not (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647)) (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse9 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse10))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse13 (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse11 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) 30)) .cse15))) (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse19 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse19 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse17 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse18 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse18)))) 30))) (or .cse10 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse23 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse23 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse21 (store (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~b~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse21 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse22 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse22)))) 30))))) (or .cse15 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse27 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse27 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse25 (store (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse26 (select (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse25 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse26 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse26))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse31 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse31 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse29 (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse29 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse30 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse30)))))) .cse10)))))) is different from true [2022-07-20 22:08:09,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:08:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 3 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-20 22:08:09,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:08:09,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726814708] [2022-07-20 22:08:09,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:08:09,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740429608] [2022-07-20 22:08:09,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740429608] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:08:09,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:08:09,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2022-07-20 22:08:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137144128] [2022-07-20 22:08:09,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:08:09,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 22:08:09,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:08:09,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 22:08:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=580, Unknown=17, NotChecked=156, Total=870 [2022-07-20 22:08:09,106 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:08:11,185 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (let ((.cse15 (not .cse0)) (.cse10 (not .cse1))) (and (or (not (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647)) (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse9 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse10))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse13 (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse11 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) 30)) .cse15))) (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse19 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse19 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse17 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse18 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse18)))) 30))) (or .cse10 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse23 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse23 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse21 (store (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~b~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse21 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse22 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse22)))) 30))))) (or .cse15 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse27 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse27 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse25 (store (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse26 (select (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse25 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse26 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse26))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse31 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse31 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse29 (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse29 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse30 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse30)))))) .cse10))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from true [2022-07-20 22:08:13,201 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse10 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (.cse0 (<= (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse15 (not .cse0)) (.cse1 (not .cse10))) (and (or (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse8 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse10))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse13)))) 30)) .cse15)) (not (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))) (or (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse19 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse19 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse18 (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| .cse17) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse16 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse17 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse18 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse18)))) 30)) .cse10) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse23 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse23 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse22 (store (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| .cse22) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse22 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse20 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse1)) .cse15) (= 10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse27 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse27 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse26 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse24 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) 30)) .cse10) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 30 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse31 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse31 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse29 (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse29 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse30 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse30)))))) .cse1)) .cse0) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from true [2022-07-20 22:08:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:08:14,887 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-07-20 22:08:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 22:08:14,888 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 22:08:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:08:14,888 INFO L225 Difference]: With dead ends: 89 [2022-07-20 22:08:14,888 INFO L226 Difference]: Without dead ends: 65 [2022-07-20 22:08:14,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 56.2s TimeCoverageRelationStatistics Valid=246, Invalid=945, Unknown=19, NotChecked=350, Total=1560 [2022-07-20 22:08:14,889 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:08:14,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 152 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 287 Invalid, 0 Unknown, 219 Unchecked, 0.6s Time] [2022-07-20 22:08:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-20 22:08:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-20 22:08:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 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-20 22:08:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-20 22:08:14,896 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 38 [2022-07-20 22:08:14,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:08:14,896 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-20 22:08:14,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:08:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-20 22:08:14,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 22:08:14,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:08:14,897 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:08:14,903 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-20 22:08:15,103 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-20 22:08:15,103 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:08:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:08:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash 173090424, now seen corresponding path program 6 times [2022-07-20 22:08:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:08:15,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160327493] [2022-07-20 22:08:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:08:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:08:15,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:08:15,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068313329] [2022-07-20 22:08:15,122 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 22:08:15,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:08:15,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:08:15,132 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-20 22:08:15,132 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-20 22:08:15,703 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-20 22:08:15,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:08:15,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-20 22:08:15,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:08:15,718 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-20 22:08:15,736 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-20 22:08:15,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:15,783 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 25 treesize of output 24 [2022-07-20 22:08:15,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:15,830 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 25 treesize of output 24 [2022-07-20 22:08:15,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:15,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 22:08:15,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 22:08:15,984 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 22:08:15,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 127 [2022-07-20 22:08:15,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:08:15,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:15,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:15,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:15,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:15,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:15,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:15,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 194 [2022-07-20 22:08:16,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:16,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:16,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:16,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:16,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:08:16,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:08:16,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:16,126 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-20 22:08:16,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 75 [2022-07-20 22:08:16,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:16,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:16,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:16,186 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 22:08:16,186 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 3 case distinctions, treesize of input 47 treesize of output 44 [2022-07-20 22:08:16,293 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 22:08:16,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 32 [2022-07-20 22:08:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:08:16,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:08:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:08:51,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:08:51,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160327493] [2022-07-20 22:08:51,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:08:51,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068313329] [2022-07-20 22:08:51,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068313329] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:08:51,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:08:51,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2022-07-20 22:08:51,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964127672] [2022-07-20 22:08:51,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:08:51,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 22:08:51,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:08:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 22:08:51,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2022-07-20 22:08:51,596 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 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-20 22:08:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:08:52,067 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-07-20 22:08:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-20 22:08:52,068 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 22:08:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:08:52,068 INFO L225 Difference]: With dead ends: 100 [2022-07-20 22:08:52,068 INFO L226 Difference]: Without dead ends: 98 [2022-07-20 22:08:52,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=228, Invalid=1254, Unknown=0, NotChecked=0, Total=1482 [2022-07-20 22:08:52,069 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:08:52,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 93 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2022-07-20 22:08:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-20 22:08:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2022-07-20 22:08:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.1123595505617978) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 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-20 22:08:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-20 22:08:52,081 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 40 [2022-07-20 22:08:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:08:52,082 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-20 22:08:52,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 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-20 22:08:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-20 22:08:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 22:08:52,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:08:52,083 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:08:52,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-20 22:08:52,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-20 22:08:52,289 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:08:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:08:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash -734671131, now seen corresponding path program 6 times [2022-07-20 22:08:52,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:08:52,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24763465] [2022-07-20 22:08:52,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:08:52,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:08:52,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:08:52,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712622294] [2022-07-20 22:08:52,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 22:08:52,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:08:52,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:08:52,329 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:08:52,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 22:08:56,631 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-20 22:08:56,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:08:56,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-20 22:08:56,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:08:56,950 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-20 22:08:57,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:57,016 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 24 [2022-07-20 22:08:57,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:57,087 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 24 [2022-07-20 22:08:57,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:57,161 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 24 [2022-07-20 22:08:57,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:57,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 24 [2022-07-20 22:08:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:08:57,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:08:58,249 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 54 treesize of output 52 [2022-07-20 22:08:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-20 22:08:58,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:08:58,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24763465] [2022-07-20 22:08:58,452 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:08:58,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712622294] [2022-07-20 22:08:58,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712622294] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:08:58,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:08:58,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 38 [2022-07-20 22:08:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668090459] [2022-07-20 22:08:58,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:08:58,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 22:08:58,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:08:58,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 22:08:58,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2022-07-20 22:08:58,456 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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-20 22:09:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:09:03,927 INFO L93 Difference]: Finished difference Result 278 states and 297 transitions. [2022-07-20 22:09:03,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-07-20 22:09:03,927 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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) Word has length 42 [2022-07-20 22:09:03,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:09:03,928 INFO L225 Difference]: With dead ends: 278 [2022-07-20 22:09:03,928 INFO L226 Difference]: Without dead ends: 265 [2022-07-20 22:09:03,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 56 SyntacticMatches, 25 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4676 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2096, Invalid=8616, Unknown=0, NotChecked=0, Total=10712 [2022-07-20 22:09:03,931 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 789 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 768 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:09:03,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 555 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 984 Invalid, 0 Unknown, 768 Unchecked, 1.0s Time] [2022-07-20 22:09:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-20 22:09:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 119. [2022-07-20 22:09:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.1271186440677967) internal successors, (133), 118 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:09:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2022-07-20 22:09:03,947 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 42 [2022-07-20 22:09:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:09:03,947 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2022-07-20 22:09:03,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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-20 22:09:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2022-07-20 22:09:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:09:03,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:09:03,948 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:09:03,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 22:09:04,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:09:04,155 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:09:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:09:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1596358930, now seen corresponding path program 7 times [2022-07-20 22:09:04,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:09:04,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663042553] [2022-07-20 22:09:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:09:04,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:09:04,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:09:04,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047898323] [2022-07-20 22:09:04,168 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 22:09:04,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:09:04,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:09:04,169 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:09:04,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 22:09:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:09:04,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-20 22:09:04,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:09:04,568 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-20 22:09:04,584 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-20 22:09:04,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 99 [2022-07-20 22:09:04,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:09:04,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2022-07-20 22:09:04,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 119 [2022-07-20 22:09:04,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2022-07-20 22:09:04,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,796 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 30 treesize of output 32 [2022-07-20 22:09:04,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,858 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-20 22:09:04,926 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 22:09:04,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 137 [2022-07-20 22:09:04,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:09:04,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:04,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 197 [2022-07-20 22:09:04,941 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-20 22:09:05,062 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 22:09:05,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 150 [2022-07-20 22:09:05,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:09:05,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 216 [2022-07-20 22:09:05,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:09:05,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:05,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:09:05,192 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-20 22:09:05,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 77 [2022-07-20 22:09:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:09:05,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:09:49,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88241170 treesize of output 87340050