/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/array-fpi/nsqm-if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 15:31:56,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 15:31:56,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 15:31:56,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 15:31:56,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 15:31:56,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 15:31:56,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 15:31:56,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 15:31:56,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 15:31:56,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 15:31:56,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 15:31:56,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 15:31:56,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 15:31:56,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 15:31:56,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 15:31:56,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 15:31:56,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 15:31:56,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 15:31:56,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 15:31:56,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 15:31:56,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 15:31:56,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 15:31:56,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 15:31:56,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 15:31:56,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 15:31:56,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 15:31:56,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 15:31:56,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 15:31:56,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 15:31:56,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 15:31:56,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 15:31:56,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 15:31:56,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 15:31:56,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 15:31:56,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 15:31:56,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 15:31:56,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 15:31:56,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 15:31:56,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 15:31:56,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 15:31:56,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 15:31:56,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-02 15:31:56,868 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 15:31:56,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 15:31:56,868 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 15:31:56,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 15:31:56,869 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 15:31:56,870 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 15:31:56,870 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 15:31:56,870 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 15:31:56,870 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 15:31:56,870 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 15:31:56,871 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 15:31:56,871 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 15:31:56,871 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 15:31:56,871 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 15:31:56,872 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 15:31:56,872 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 15:31:56,872 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 15:31:56,872 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 15:31:56,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 15:31:56,873 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 15:31:56,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 15:31:56,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 15:31:56,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 15:31:56,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 15:31:56,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 15:31:56,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 15:31:56,874 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 15:31:56,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 15:31:56,874 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 15:31:56,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 15:31:56,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 15:31:56,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 15:31:56,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 15:31:56,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 15:31:56,876 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 15:31:56,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 15:31:56,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 15:31:56,876 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 15:31:56,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 15:31:56,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 15:31:56,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 15:31:56,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.sifa: Abstract Domain -> OctagonDomain [2023-04-02 15:31:57,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 15:31:57,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 15:31:57,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 15:31:57,116 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 15:31:57,116 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 15:31:57,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/nsqm-if.c [2023-04-02 15:31:58,279 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 15:31:58,453 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 15:31:58,453 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/nsqm-if.c [2023-04-02 15:31:58,459 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4aabcb2/35de031d341148a1a73f25d06fb601b4/FLAGeff5477d7 [2023-04-02 15:31:58,471 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4aabcb2/35de031d341148a1a73f25d06fb601b4 [2023-04-02 15:31:58,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 15:31:58,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 15:31:58,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 15:31:58,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 15:31:58,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 15:31:58,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16847df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58, skipping insertion in model container [2023-04-02 15:31:58,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 15:31:58,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 15:31:58,635 WARN L247 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/nsqm-if.c[590,603] [2023-04-02 15:31:58,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 15:31:58,659 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 15:31:58,668 WARN L247 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/nsqm-if.c[590,603] [2023-04-02 15:31:58,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 15:31:58,697 INFO L208 MainTranslator]: Completed translation [2023-04-02 15:31:58,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58 WrapperNode [2023-04-02 15:31:58,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 15:31:58,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 15:31:58,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 15:31:58,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 15:31:58,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,725 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 15:31:58,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 15:31:58,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 15:31:58,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 15:31:58,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58" (1/1) ... [2023-04-02 15:31:58,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 15:31:58,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:31:58,766 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) [2023-04-02 15:31:58,769 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 [2023-04-02 15:31:58,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 15:31:58,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 15:31:58,810 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 15:31:58,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 15:31:58,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 15:31:58,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 15:31:58,811 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 15:31:58,811 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 15:31:58,811 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 15:31:58,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 15:31:58,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 15:31:58,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 15:31:58,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 15:31:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 15:31:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 15:31:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 15:31:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 15:31:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 15:31:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 15:31:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 15:31:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 15:31:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 15:31:58,872 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 15:31:58,874 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 15:31:59,046 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 15:31:59,126 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 15:31:59,126 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-02 15:31:59,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 03:31:59 BoogieIcfgContainer [2023-04-02 15:31:59,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 15:31:59,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 15:31:59,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 15:31:59,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 15:31:59,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 03:31:58" (1/3) ... [2023-04-02 15:31:59,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ca54ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 03:31:59, skipping insertion in model container [2023-04-02 15:31:59,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 03:31:58" (2/3) ... [2023-04-02 15:31:59,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ca54ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 03:31:59, skipping insertion in model container [2023-04-02 15:31:59,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 03:31:59" (3/3) ... [2023-04-02 15:31:59,152 INFO L112 eAbstractionObserver]: Analyzing ICFG nsqm-if.c [2023-04-02 15:31:59,182 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 15:31:59,182 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 15:31:59,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 15:31:59,260 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=FINITE_AUTOMATA, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50b97845, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 15:31:59,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 15:31:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 15:31:59,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-02 15:31:59,270 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:31:59,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:31:59,271 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:31:59,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:31:59,277 INFO L85 PathProgramCache]: Analyzing trace with hash -329856190, now seen corresponding path program 1 times [2023-04-02 15:31:59,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:31:59,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496570191] [2023-04-02 15:31:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:31:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:31:59,389 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:31:59,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254957502] [2023-04-02 15:31:59,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:31:59,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:31:59,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:31:59,393 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) [2023-04-02 15:31:59,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 15:31:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 15:31:59,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-02 15:31:59,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:31:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:31:59,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 15:31:59,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:31:59,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496570191] [2023-04-02 15:31:59,601 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:31:59,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254957502] [2023-04-02 15:31:59,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254957502] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 15:31:59,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 15:31:59,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 15:31:59,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114231938] [2023-04-02 15:31:59,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 15:31:59,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 15:31:59,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:31:59,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 15:31:59,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-02 15:31:59,642 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 15:31:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:31:59,746 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2023-04-02 15:31:59,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 15:31:59,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-04-02 15:31:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:31:59,756 INFO L225 Difference]: With dead ends: 48 [2023-04-02 15:31:59,757 INFO L226 Difference]: Without dead ends: 26 [2023-04-02 15:31:59,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-02 15:31:59,762 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 15:31:59,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 15:31:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-04-02 15:31:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2023-04-02 15:31:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 15:31:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-04-02 15:31:59,807 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2023-04-02 15:31:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:31:59,807 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-04-02 15:31:59,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 15:31:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-04-02 15:31:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-02 15:31:59,809 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:31:59,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:31:59,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:00,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-04-02 15:32:00,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:00,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash 276511424, now seen corresponding path program 1 times [2023-04-02 15:32:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:00,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949057118] [2023-04-02 15:32:00,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:00,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:00,062 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:00,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1012069598] [2023-04-02 15:32:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:00,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:00,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:00,073 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) [2023-04-02 15:32:00,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 15:32:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 15:32:00,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core [2023-04-02 15:32:00,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:00,266 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-04-02 15:32:00,349 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2023-04-02 15:32:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 15:32:00,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:00,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:00,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-04-02 15:32:00,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:00,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 10 [2023-04-02 15:32:00,689 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 7 [2023-04-02 15:32:00,694 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 6 [2023-04-02 15:32:00,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 15:32:00,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949057118] [2023-04-02 15:32:00,739 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:00,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012069598] [2023-04-02 15:32:00,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012069598] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:00,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [657347659] [2023-04-02 15:32:00,765 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-02 15:32:00,765 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:00,768 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:00,773 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:00,773 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:00,909 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:01,347 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2023-04-02 15:32:01,379 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:01,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:01,395 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:02,142 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '310#(and (<= 1 |#StackHeapBarrier|) (<= ~N~0 2147483647) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_1 1) |#StackHeapBarrier|) (not (= (+ ~N~0 1) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) 0))))) (<= 1 ~N~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:02,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:02,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:02,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-04-02 15:32:02,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25464275] [2023-04-02 15:32:02,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:02,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 15:32:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:02,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 15:32:02,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2023-04-02 15:32:02,146 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 15:32:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:02,431 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-04-02 15:32:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 15:32:02,432 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2023-04-02 15:32:02,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:02,433 INFO L225 Difference]: With dead ends: 39 [2023-04-02 15:32:02,433 INFO L226 Difference]: Without dead ends: 37 [2023-04-02 15:32:02,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 15:32:02,434 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:02,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 85 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 15:32:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-02 15:32:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-04-02 15:32:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 15:32:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-04-02 15:32:02,444 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2023-04-02 15:32:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:02,445 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-04-02 15:32:02,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 15:32:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-04-02 15:32:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-02 15:32:02,446 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:02,446 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:32:02,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:02,652 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,SelfDestructingSolverStorable1 [2023-04-02 15:32:02,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:02,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1073576919, now seen corresponding path program 2 times [2023-04-02 15:32:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672488457] [2023-04-02 15:32:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:02,720 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:02,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91809865] [2023-04-02 15:32:02,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 15:32:02,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:02,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:02,727 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) [2023-04-02 15:32:02,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 15:32:02,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 15:32:02,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 15:32:02,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 15:32:02,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:32:02,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:32:02,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672488457] [2023-04-02 15:32:02,853 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91809865] [2023-04-02 15:32:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91809865] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [688947714] [2023-04-02 15:32:02,858 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-02 15:32:02,858 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:02,858 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:02,859 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:02,859 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:02,893 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:03,187 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2023-04-02 15:32:03,202 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:03,207 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:03,212 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:03,768 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '565#(and (<= 1 |#StackHeapBarrier|) (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int)) (and (not (= (+ ~N~0 1) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) 0))) (<= (+ v_main_~a~0.base_BEFORE_CALL_2 1) |#StackHeapBarrier|))) (<= ~N~0 2147483647) (<= 1 ~N~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:03,768 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:03,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:03,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-04-02 15:32:03,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396475232] [2023-04-02 15:32:03,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:03,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 15:32:03,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 15:32:03,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2023-04-02 15:32:03,771 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:03,869 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-04-02 15:32:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 15:32:03,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-04-02 15:32:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:03,870 INFO L225 Difference]: With dead ends: 51 [2023-04-02 15:32:03,870 INFO L226 Difference]: Without dead ends: 31 [2023-04-02 15:32:03,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2023-04-02 15:32:03,872 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:03,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 15:32:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-02 15:32:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2023-04-02 15:32:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 15:32:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-04-02 15:32:03,878 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2023-04-02 15:32:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:03,879 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-04-02 15:32:03,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-04-02 15:32:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-02 15:32:03,879 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:03,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:32:03,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:04,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:04,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:04,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:04,086 INFO L85 PathProgramCache]: Analyzing trace with hash -737043390, now seen corresponding path program 3 times [2023-04-02 15:32:04,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:04,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383319702] [2023-04-02 15:32:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:04,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:04,130 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:04,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457681289] [2023-04-02 15:32:04,131 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 15:32:04,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:04,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:04,137 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) [2023-04-02 15:32:04,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 15:32:04,296 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 15:32:04,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 15:32:04,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 26 conjunts are in the unsatisfiable core [2023-04-02 15:32:04,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:04,330 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-04-02 15:32:04,349 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:04,379 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2023-04-02 15:32:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 15:32:04,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:04,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:04,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:04,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-04-02 15:32:04,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:04,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 10 [2023-04-02 15:32:04,704 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 32 treesize of output 20 [2023-04-02 15:32:04,708 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 32 [2023-04-02 15:32:04,712 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 24 [2023-04-02 15:32:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 15:32:04,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:04,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383319702] [2023-04-02 15:32:04,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:04,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457681289] [2023-04-02 15:32:04,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457681289] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:04,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1642385278] [2023-04-02 15:32:04,738 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-02 15:32:04,739 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:04,739 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:04,739 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:04,739 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:04,762 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:04,971 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2023-04-02 15:32:04,984 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:04,987 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:04,992 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:05,647 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '844#(and (exists ((v_main_~a~0.base_BEFORE_CALL_3 Int)) (and (not (= (+ ~N~0 1) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_3) 0))) (<= (+ v_main_~a~0.base_BEFORE_CALL_3 1) |#StackHeapBarrier|))) (<= 1 |#StackHeapBarrier|) (<= ~N~0 2147483647) (<= 1 ~N~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:05,647 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:05,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2023-04-02 15:32:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481393663] [2023-04-02 15:32:05,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:05,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-02 15:32:05,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:05,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-02 15:32:05,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2023-04-02 15:32:05,650 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:05,933 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-04-02 15:32:05,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 15:32:05,934 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-04-02 15:32:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:05,935 INFO L225 Difference]: With dead ends: 48 [2023-04-02 15:32:05,935 INFO L226 Difference]: Without dead ends: 46 [2023-04-02 15:32:05,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 15:32:05,936 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:05,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 101 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 15:32:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-04-02 15:32:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2023-04-02 15:32:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 15:32:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-04-02 15:32:05,948 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2023-04-02 15:32:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:05,949 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-04-02 15:32:05,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-04-02 15:32:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 15:32:05,950 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:05,950 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:32:05,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-02 15:32:06,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:06,157 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:06,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash 944203426, now seen corresponding path program 4 times [2023-04-02 15:32:06,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:06,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596946355] [2023-04-02 15:32:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:06,206 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:06,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715130516] [2023-04-02 15:32:06,206 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 15:32:06,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:06,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:06,208 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) [2023-04-02 15:32:06,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 15:32:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 15:32:06,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-02 15:32:06,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 15:32:06,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 15:32:06,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596946355] [2023-04-02 15:32:06,370 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715130516] [2023-04-02 15:32:06,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715130516] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [234859630] [2023-04-02 15:32:06,372 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-02 15:32:06,372 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:06,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:06,372 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:06,373 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:06,394 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:06,614 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2023-04-02 15:32:06,626 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:06,629 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:06,633 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:07,174 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1140#(and (exists ((v_main_~a~0.base_BEFORE_CALL_4 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_4 1) |#StackHeapBarrier|) (not (= (+ ~N~0 1) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_4) 0))))) (<= 1 |#StackHeapBarrier|) (<= ~N~0 2147483647) (<= 1 ~N~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:07,174 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:07,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:07,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-04-02 15:32:07,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138962474] [2023-04-02 15:32:07,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:07,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 15:32:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:07,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 15:32:07,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2023-04-02 15:32:07,176 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:07,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:07,304 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2023-04-02 15:32:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 15:32:07,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-04-02 15:32:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:07,307 INFO L225 Difference]: With dead ends: 70 [2023-04-02 15:32:07,307 INFO L226 Difference]: Without dead ends: 51 [2023-04-02 15:32:07,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2023-04-02 15:32:07,309 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:07,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 52 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 15:32:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-04-02 15:32:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2023-04-02 15:32:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 15:32:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-04-02 15:32:07,336 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 23 [2023-04-02 15:32:07,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:07,336 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-04-02 15:32:07,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-04-02 15:32:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 15:32:07,338 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:07,338 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:32:07,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:07,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:07,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:07,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:07,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1248848471, now seen corresponding path program 5 times [2023-04-02 15:32:07,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962045585] [2023-04-02 15:32:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:07,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:07,589 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:07,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977528568] [2023-04-02 15:32:07,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 15:32:07,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:07,598 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) [2023-04-02 15:32:07,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 15:32:07,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 15:32:07,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 15:32:07,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-02 15:32:07,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:32:07,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:32:07,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962045585] [2023-04-02 15:32:07,877 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:07,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977528568] [2023-04-02 15:32:07,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977528568] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:07,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [326993221] [2023-04-02 15:32:07,880 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-02 15:32:07,881 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:07,881 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:07,881 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:07,881 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:07,902 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:08,084 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2023-04-02 15:32:08,096 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:08,099 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:08,103 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:08,644 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1499#(and (<= 1 |#StackHeapBarrier|) (exists ((v_main_~a~0.base_BEFORE_CALL_5 Int)) (and (not (= (+ ~N~0 1) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_5) 0))) (<= (+ v_main_~a~0.base_BEFORE_CALL_5 1) |#StackHeapBarrier|))) (<= ~N~0 2147483647) (<= 1 ~N~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:08,645 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:08,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:08,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2023-04-02 15:32:08,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536943124] [2023-04-02 15:32:08,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:08,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 15:32:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:08,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 15:32:08,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2023-04-02 15:32:08,646 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:08,943 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2023-04-02 15:32:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 15:32:08,943 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-04-02 15:32:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:08,944 INFO L225 Difference]: With dead ends: 77 [2023-04-02 15:32:08,944 INFO L226 Difference]: Without dead ends: 65 [2023-04-02 15:32:08,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2023-04-02 15:32:08,945 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:08,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 96 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 15:32:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-04-02 15:32:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2023-04-02 15:32:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 15:32:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2023-04-02 15:32:08,957 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 24 [2023-04-02 15:32:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:08,957 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2023-04-02 15:32:08,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2023-04-02 15:32:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-02 15:32:08,958 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:08,958 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:32:08,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:09,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:09,165 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:09,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2102910274, now seen corresponding path program 6 times [2023-04-02 15:32:09,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:09,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916495406] [2023-04-02 15:32:09,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:09,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:09,192 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1439120594] [2023-04-02 15:32:09,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 15:32:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:09,194 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) [2023-04-02 15:32:09,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 15:32:09,659 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 15:32:09,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 15:32:09,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjunts are in the unsatisfiable core [2023-04-02 15:32:09,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:09,700 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-04-02 15:32:09,718 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:09,738 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:09,759 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:09,788 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2023-04-02 15:32:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 15:32:09,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:09,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:10,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:10,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:10,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:10,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-04-02 15:32:10,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:10,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 10 [2023-04-02 15:32:10,498 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 54 treesize of output 42 [2023-04-02 15:32:10,501 INFO L350 Elim1Store]: Elim1 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 386 treesize of output 382 [2023-04-02 15:32:10,513 INFO L350 Elim1Store]: Elim1 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 182 treesize of output 150 [2023-04-02 15:32:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-02 15:32:10,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916495406] [2023-04-02 15:32:10,576 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439120594] [2023-04-02 15:32:10,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439120594] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [656349766] [2023-04-02 15:32:10,578 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-02 15:32:10,578 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:10,578 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:10,579 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:10,579 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:10,602 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:10,791 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2023-04-02 15:32:10,805 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:10,808 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:10,813 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:11,434 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1910#(and (<= 1 |#StackHeapBarrier|) (exists ((v_main_~a~0.base_BEFORE_CALL_6 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_6 1) |#StackHeapBarrier|) (not (= (+ ~N~0 1) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_6) 0))))) (<= ~N~0 2147483647) (<= 1 ~N~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:11,434 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:11,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:11,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-04-02 15:32:11,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492517695] [2023-04-02 15:32:11,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:11,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-02 15:32:11,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:11,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-02 15:32:11,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2023-04-02 15:32:11,436 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 23 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:12,169 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2023-04-02 15:32:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-02 15:32:12,169 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-04-02 15:32:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:12,171 INFO L225 Difference]: With dead ends: 96 [2023-04-02 15:32:12,171 INFO L226 Difference]: Without dead ends: 94 [2023-04-02 15:32:12,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=187, Invalid=1619, Unknown=0, NotChecked=0, Total=1806 [2023-04-02 15:32:12,172 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 65 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:12,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 118 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 15:32:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-04-02 15:32:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 60. [2023-04-02 15:32:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 48 states have internal predecessors, (57), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 15:32:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2023-04-02 15:32:12,187 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 25 [2023-04-02 15:32:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:12,187 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2023-04-02 15:32:12,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2023-04-02 15:32:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-02 15:32:12,188 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:12,188 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] [2023-04-02 15:32:12,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:12,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:12,393 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:12,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash 137138764, now seen corresponding path program 1 times [2023-04-02 15:32:12,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:12,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23790842] [2023-04-02 15:32:12,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:12,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:12,408 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:12,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1792824004] [2023-04-02 15:32:12,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:12,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:12,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:12,409 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) [2023-04-02 15:32:12,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 15:32:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 15:32:12,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 42 conjunts are in the unsatisfiable core [2023-04-02 15:32:12,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:12,592 INFO L350 Elim1Store]: Elim1 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 [2023-04-02 15:32:12,606 INFO L350 Elim1Store]: Elim1 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 [2023-04-02 15:32:12,627 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-04-02 15:32:12,666 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:12,697 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 32 [2023-04-02 15:32:12,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-04-02 15:32:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:32:12,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:13,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-04-02 15:32:13,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:13,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 47 [2023-04-02 15:32:13,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:13,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-04-02 15:32:13,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:13,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 38 [2023-04-02 15:32:13,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:13,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 109 [2023-04-02 15:32:13,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-04-02 15:32:13,863 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 29 [2023-04-02 15:32:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:32:13,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23790842] [2023-04-02 15:32:13,910 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792824004] [2023-04-02 15:32:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792824004] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [847329249] [2023-04-02 15:32:13,915 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 15:32:13,915 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:13,916 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:13,916 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:13,916 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:13,935 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:14,261 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 62 for LOIs [2023-04-02 15:32:14,310 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:14,313 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:14,317 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:15,398 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2387#(and (<= 1 |#StackHeapBarrier|) (<= ~N~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((v_main_~a~0.base_BEFORE_CALL_13 Int) (v_main_~i~0_BEFORE_CALL_17 Int) (|v_main_#t~mem13_BEFORE_CALL_15| Int)) (and (<= ~N~0 (+ 2147483647 v_main_~i~0_BEFORE_CALL_17)) (<= 0 v_main_~i~0_BEFORE_CALL_17) (<= 1 (+ v_main_~i~0_BEFORE_CALL_17 ~N~0)) (or (and (<= (mod v_main_~i~0_BEFORE_CALL_17 4294967296) 2147483647) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (* (mod v_main_~i~0_BEFORE_CALL_17 4294967296) 8)) |v_main_#t~mem13_BEFORE_CALL_15|)) (and (< 2147483647 (mod v_main_~i~0_BEFORE_CALL_17 4294967296)) (= |v_main_#t~mem13_BEFORE_CALL_15| (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ (* (mod v_main_~i~0_BEFORE_CALL_17 4294967296) 8) (- 34359738368)))))) (not (= (+ (* v_main_~i~0_BEFORE_CALL_17 2) ~N~0 1 (* v_main_~i~0_BEFORE_CALL_17 v_main_~i~0_BEFORE_CALL_17)) |v_main_#t~mem13_BEFORE_CALL_15|)) (<= 1 (+ v_main_~i~0_BEFORE_CALL_17 |#StackHeapBarrier|)) (< v_main_~i~0_BEFORE_CALL_17 ~N~0) (<= (+ v_main_~a~0.base_BEFORE_CALL_13 1) |#StackHeapBarrier|))) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:15,398 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:15,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:15,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2023-04-02 15:32:15,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544016660] [2023-04-02 15:32:15,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:15,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-02 15:32:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:15,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-02 15:32:15,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1505, Unknown=3, NotChecked=0, Total=1640 [2023-04-02 15:32:15,400 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 15:32:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:16,483 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2023-04-02 15:32:16,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-02 15:32:16,483 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-04-02 15:32:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:16,484 INFO L225 Difference]: With dead ends: 89 [2023-04-02 15:32:16,484 INFO L226 Difference]: Without dead ends: 77 [2023-04-02 15:32:16,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=242, Invalid=2305, Unknown=3, NotChecked=0, Total=2550 [2023-04-02 15:32:16,485 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:16,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 175 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 15:32:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-04-02 15:32:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-04-02 15:32:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 58 states have internal predecessors, (65), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2023-04-02 15:32:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2023-04-02 15:32:16,503 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 28 [2023-04-02 15:32:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:16,503 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2023-04-02 15:32:16,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 15:32:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2023-04-02 15:32:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 15:32:16,504 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:16,505 INFO L195 NwaCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:32:16,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:16,710 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,SelfDestructingSolverStorable7 [2023-04-02 15:32:16,710 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:16,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1871586814, now seen corresponding path program 7 times [2023-04-02 15:32:16,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:16,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359464737] [2023-04-02 15:32:16,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:16,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:16,763 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:16,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5695500] [2023-04-02 15:32:16,764 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 15:32:16,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:16,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:16,769 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) [2023-04-02 15:32:16,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 15:32:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 15:32:16,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-02 15:32:16,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 15:32:16,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 15:32:17,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359464737] [2023-04-02 15:32:17,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5695500] [2023-04-02 15:32:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5695500] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1666228545] [2023-04-02 15:32:17,008 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-02 15:32:17,008 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:17,009 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:17,009 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:17,009 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:17,036 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:17,200 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2023-04-02 15:32:17,210 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:17,212 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:17,215 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:17,690 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2879#(and (<= 1 |#StackHeapBarrier|) (<= ~N~0 2147483647) (exists ((v_main_~a~0.base_BEFORE_CALL_16 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_16 1) |#StackHeapBarrier|) (not (= (+ ~N~0 1) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_16) 0))))) (<= 1 ~N~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:17,690 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:17,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:17,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2023-04-02 15:32:17,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485366155] [2023-04-02 15:32:17,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:17,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-02 15:32:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:17,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-02 15:32:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2023-04-02 15:32:17,692 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:18,101 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2023-04-02 15:32:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-02 15:32:18,101 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-04-02 15:32:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:18,102 INFO L225 Difference]: With dead ends: 131 [2023-04-02 15:32:18,102 INFO L226 Difference]: Without dead ends: 110 [2023-04-02 15:32:18,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=1543, Unknown=0, NotChecked=0, Total=1806 [2023-04-02 15:32:18,104 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:18,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 92 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 15:32:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-04-02 15:32:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 86. [2023-04-02 15:32:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.203125) internal successors, (77), 68 states have internal predecessors, (77), 14 states have call successors, (14), 9 states have call predecessors, (14), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-02 15:32:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2023-04-02 15:32:18,127 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 29 [2023-04-02 15:32:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:18,127 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2023-04-02 15:32:18,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2023-04-02 15:32:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-02 15:32:18,128 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:18,128 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:32:18,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:18,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:18,334 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:18,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash -637714516, now seen corresponding path program 2 times [2023-04-02 15:32:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:18,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182763721] [2023-04-02 15:32:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:18,348 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:18,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512242622] [2023-04-02 15:32:18,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 15:32:18,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:18,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:18,350 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) [2023-04-02 15:32:18,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-02 15:32:18,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 15:32:18,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 15:32:18,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2023-04-02 15:32:18,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 15:32:18,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 15:32:18,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182763721] [2023-04-02 15:32:18,716 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512242622] [2023-04-02 15:32:18,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512242622] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069536781] [2023-04-02 15:32:18,717 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 15:32:18,717 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:18,718 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:18,718 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:18,718 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:18,734 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:19,040 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 62 for LOIs [2023-04-02 15:32:19,088 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:19,091 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:19,094 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:21,759 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3468#(and (exists ((v_main_~a~0.base_BEFORE_CALL_21 Int) (v_main_~i~0_BEFORE_CALL_25 Int) (|v_main_#t~mem13_BEFORE_CALL_23| Int)) (and (<= 0 v_main_~i~0_BEFORE_CALL_25) (<= ~N~0 (+ 2147483647 v_main_~i~0_BEFORE_CALL_25)) (<= (+ v_main_~a~0.base_BEFORE_CALL_21 1) |#StackHeapBarrier|) (< v_main_~i~0_BEFORE_CALL_25 ~N~0) (not (= |v_main_#t~mem13_BEFORE_CALL_23| (+ (* v_main_~i~0_BEFORE_CALL_25 v_main_~i~0_BEFORE_CALL_25) ~N~0 (* v_main_~i~0_BEFORE_CALL_25 2) 1))) (<= 1 (+ v_main_~i~0_BEFORE_CALL_25 ~N~0)) (or (and (< 2147483647 (mod v_main_~i~0_BEFORE_CALL_25 4294967296)) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_21) (+ (* (mod v_main_~i~0_BEFORE_CALL_25 4294967296) 8) (- 34359738368))) |v_main_#t~mem13_BEFORE_CALL_23|)) (and (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_21) (* (mod v_main_~i~0_BEFORE_CALL_25 4294967296) 8)) |v_main_#t~mem13_BEFORE_CALL_23|) (<= (mod v_main_~i~0_BEFORE_CALL_25 4294967296) 2147483647))) (<= 1 (+ v_main_~i~0_BEFORE_CALL_25 |#StackHeapBarrier|)))) (<= 1 |#StackHeapBarrier|) (<= ~N~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:21,760 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:21,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:21,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-04-02 15:32:21,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730454481] [2023-04-02 15:32:21,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:21,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-02 15:32:21,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:21,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-02 15:32:21,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2023-04-02 15:32:21,762 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 15:32:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:22,168 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2023-04-02 15:32:22,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-02 15:32:22,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-04-02 15:32:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:22,169 INFO L225 Difference]: With dead ends: 110 [2023-04-02 15:32:22,170 INFO L226 Difference]: Without dead ends: 90 [2023-04-02 15:32:22,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=210, Invalid=1350, Unknown=0, NotChecked=0, Total=1560 [2023-04-02 15:32:22,171 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:22,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 115 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 15:32:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-04-02 15:32:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-04-02 15:32:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.152542372881356) internal successors, (68), 61 states have internal predecessors, (68), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-04-02 15:32:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-04-02 15:32:22,198 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 30 [2023-04-02 15:32:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:22,198 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-04-02 15:32:22,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 15:32:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-04-02 15:32:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-02 15:32:22,203 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:22,204 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:32:22,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:22,410 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,SelfDestructingSolverStorable9 [2023-04-02 15:32:22,411 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:22,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1682701833, now seen corresponding path program 8 times [2023-04-02 15:32:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99751113] [2023-04-02 15:32:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:22,450 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:22,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376953983] [2023-04-02 15:32:22,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 15:32:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:22,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:22,464 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) [2023-04-02 15:32:22,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-02 15:32:23,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-02 15:32:23,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 15:32:23,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-02 15:32:23,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:32:23,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:32:24,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99751113] [2023-04-02 15:32:24,121 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376953983] [2023-04-02 15:32:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376953983] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [290437153] [2023-04-02 15:32:24,123 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-02 15:32:24,124 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:24,124 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:24,124 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:24,124 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:24,141 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:24,284 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2023-04-02 15:32:24,291 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:24,293 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:24,296 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:24,964 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4016#(and (<= 1 |#StackHeapBarrier|) (<= ~N~0 2147483647) (<= 1 ~N~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (exists ((v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_24 1) |#StackHeapBarrier|) (not (= (+ ~N~0 1) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 0))))) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:24,964 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:24,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:24,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-04-02 15:32:24,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4660507] [2023-04-02 15:32:24,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:24,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-02 15:32:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:24,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-02 15:32:24,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2023-04-02 15:32:24,966 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:25,886 INFO L93 Difference]: Finished difference Result 199 states and 250 transitions. [2023-04-02 15:32:25,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-04-02 15:32:25,886 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-04-02 15:32:25,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:25,888 INFO L225 Difference]: With dead ends: 199 [2023-04-02 15:32:25,888 INFO L226 Difference]: Without dead ends: 175 [2023-04-02 15:32:25,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=797, Invalid=4173, Unknown=0, NotChecked=0, Total=4970 [2023-04-02 15:32:25,890 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 108 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:25,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 106 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-02 15:32:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-04-02 15:32:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 115. [2023-04-02 15:32:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 95 states have internal predecessors, (109), 17 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2023-04-02 15:32:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2023-04-02 15:32:25,926 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 30 [2023-04-02 15:32:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:25,926 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2023-04-02 15:32:25,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:32:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2023-04-02 15:32:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-02 15:32:25,928 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:25,928 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:32:25,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:26,137 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,SelfDestructingSolverStorable10 [2023-04-02 15:32:26,138 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:26,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:26,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1333055156, now seen corresponding path program 3 times [2023-04-02 15:32:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996072163] [2023-04-02 15:32:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:26,158 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:26,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597994397] [2023-04-02 15:32:26,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 15:32:26,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:26,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:26,169 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) [2023-04-02 15:32:26,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-02 15:32:26,649 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 15:32:26,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 15:32:26,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 65 conjunts are in the unsatisfiable core [2023-04-02 15:32:26,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:26,661 INFO L350 Elim1Store]: Elim1 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 [2023-04-02 15:32:26,680 INFO L350 Elim1Store]: Elim1 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 [2023-04-02 15:32:26,699 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-04-02 15:32:26,718 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-04-02 15:32:26,738 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-04-02 15:32:26,776 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:26,803 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 32 [2023-04-02 15:32:26,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-04-02 15:32:26,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-04-02 15:32:27,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-04-02 15:32:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:32:27,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:27,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-04-02 15:32:31,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:31,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-04-02 15:32:32,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:32,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2023-04-02 15:32:33,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:33,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 47 [2023-04-02 15:32:33,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:33,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-04-02 15:32:33,422 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 5498 treesize of output 5456 [2023-04-02 15:32:33,503 INFO L350 Elim1Store]: Elim1 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 225 treesize of output 221 [2023-04-02 15:32:33,657 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 33 [2023-04-02 15:32:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 15:32:33,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:33,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996072163] [2023-04-02 15:32:33,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:33,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597994397] [2023-04-02 15:32:33,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597994397] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:33,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1369686042] [2023-04-02 15:32:33,693 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 15:32:33,693 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:33,694 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:33,694 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:33,694 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:33,712 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:34,015 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 62 for LOIs [2023-04-02 15:32:34,053 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:34,057 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:34,060 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:35,258 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4855#(and (<= 1 |#StackHeapBarrier|) (<= ~N~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((v_main_~a~0.base_BEFORE_CALL_31 Int) (|v_main_#t~mem13_BEFORE_CALL_33| Int) (v_main_~i~0_BEFORE_CALL_36 Int)) (and (or (and (<= (mod v_main_~i~0_BEFORE_CALL_36 4294967296) 2147483647) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_31) (* (mod v_main_~i~0_BEFORE_CALL_36 4294967296) 8)) |v_main_#t~mem13_BEFORE_CALL_33|)) (and (= |v_main_#t~mem13_BEFORE_CALL_33| (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_31) (+ (* (mod v_main_~i~0_BEFORE_CALL_36 4294967296) 8) (- 34359738368)))) (< 2147483647 (mod v_main_~i~0_BEFORE_CALL_36 4294967296)))) (<= ~N~0 (+ 2147483647 v_main_~i~0_BEFORE_CALL_36)) (<= 0 v_main_~i~0_BEFORE_CALL_36) (not (= (+ (* v_main_~i~0_BEFORE_CALL_36 v_main_~i~0_BEFORE_CALL_36) ~N~0 (* v_main_~i~0_BEFORE_CALL_36 2) 1) |v_main_#t~mem13_BEFORE_CALL_33|)) (<= 1 (+ v_main_~i~0_BEFORE_CALL_36 ~N~0)) (< v_main_~i~0_BEFORE_CALL_36 ~N~0) (<= (+ v_main_~a~0.base_BEFORE_CALL_31 1) |#StackHeapBarrier|) (<= 1 (+ v_main_~i~0_BEFORE_CALL_36 |#StackHeapBarrier|)))) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:35,259 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:35,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:35,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2023-04-02 15:32:35,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690442417] [2023-04-02 15:32:35,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:35,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-02 15:32:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:35,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-02 15:32:35,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2357, Unknown=5, NotChecked=0, Total=2550 [2023-04-02 15:32:35,260 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 15:32:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:32:41,109 INFO L93 Difference]: Finished difference Result 193 states and 233 transitions. [2023-04-02 15:32:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-04-02 15:32:41,109 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2023-04-02 15:32:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:32:41,111 INFO L225 Difference]: With dead ends: 193 [2023-04-02 15:32:41,111 INFO L226 Difference]: Without dead ends: 191 [2023-04-02 15:32:41,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=505, Invalid=4460, Unknown=5, NotChecked=0, Total=4970 [2023-04-02 15:32:41,113 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 67 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-04-02 15:32:41,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 230 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-04-02 15:32:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-04-02 15:32:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 162. [2023-04-02 15:32:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 122 states have (on average 1.1557377049180328) internal successors, (141), 130 states have internal predecessors, (141), 30 states have call successors, (30), 11 states have call predecessors, (30), 9 states have return successors, (26), 20 states have call predecessors, (26), 26 states have call successors, (26) [2023-04-02 15:32:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2023-04-02 15:32:41,179 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 32 [2023-04-02 15:32:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:32:41,180 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2023-04-02 15:32:41,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 15:32:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2023-04-02 15:32:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-02 15:32:41,181 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:32:41,181 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:32:41,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-02 15:32:41,385 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,SelfDestructingSolverStorable11 [2023-04-02 15:32:41,385 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:32:41,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:32:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1672916802, now seen corresponding path program 9 times [2023-04-02 15:32:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:32:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96080283] [2023-04-02 15:32:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:32:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:32:41,418 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:32:41,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352882160] [2023-04-02 15:32:41,418 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 15:32:41,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:32:41,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:32:41,419 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) [2023-04-02 15:32:41,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-02 15:32:51,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 15:32:51,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 15:32:51,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 64 conjunts are in the unsatisfiable core [2023-04-02 15:32:51,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:32:51,883 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-04-02 15:32:51,906 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:51,931 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:51,957 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:51,983 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:52,022 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:52,051 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:52,077 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-04-02 15:32:52,125 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2023-04-02 15:32:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 15:32:52,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:32:52,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:52,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:52,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:52,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:53,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:53,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:54,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-04-02 15:32:55,466 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:55,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-04-02 15:32:55,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:32:55,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 10 [2023-04-02 15:32:55,502 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 98 treesize of output 86 [2023-04-02 15:32:55,763 INFO L350 Elim1Store]: Elim1 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 839385070 treesize of output 838860782 [2023-04-02 15:32:57,715 INFO L350 Elim1Store]: Elim1 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 3182 treesize of output 2670 [2023-04-02 15:32:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-04-02 15:32:58,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:32:58,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96080283] [2023-04-02 15:32:58,256 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:32:58,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352882160] [2023-04-02 15:32:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352882160] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:32:58,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [876174393] [2023-04-02 15:32:58,257 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-02 15:32:58,257 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:32:58,257 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:32:58,258 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:32:58,258 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:32:58,282 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:32:58,403 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2023-04-02 15:32:58,412 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:32:58,414 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:32:58,417 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:32:59,129 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5747#(and (<= 1 |#StackHeapBarrier|) (<= ~N~0 2147483647) (<= 1 ~N~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((v_main_~a~0.base_BEFORE_CALL_34 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_34 1) |#StackHeapBarrier|) (not (= (+ ~N~0 1) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_34) 0))))) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:32:59,129 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:32:59,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:32:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 35 [2023-04-02 15:32:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916888959] [2023-04-02 15:32:59,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:32:59,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-02 15:32:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:32:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-02 15:32:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2207, Unknown=0, NotChecked=0, Total=2450 [2023-04-02 15:32:59,131 INFO L87 Difference]: Start difference. First operand 162 states and 197 transitions. Second operand has 35 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:33:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:33:02,098 INFO L93 Difference]: Finished difference Result 308 states and 388 transitions. [2023-04-02 15:33:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-04-02 15:33:02,100 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-04-02 15:33:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:33:02,102 INFO L225 Difference]: With dead ends: 308 [2023-04-02 15:33:02,102 INFO L226 Difference]: Without dead ends: 306 [2023-04-02 15:33:02,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=393, Invalid=3029, Unknown=0, NotChecked=0, Total=3422 [2023-04-02 15:33:02,104 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 87 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-04-02 15:33:02,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 222 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-04-02 15:33:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-04-02 15:33:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 176. [2023-04-02 15:33:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 134 states have (on average 1.2014925373134329) internal successors, (161), 143 states have internal predecessors, (161), 31 states have call successors, (31), 12 states have call predecessors, (31), 10 states have return successors, (27), 20 states have call predecessors, (27), 27 states have call successors, (27) [2023-04-02 15:33:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 219 transitions. [2023-04-02 15:33:02,178 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 219 transitions. Word has length 33 [2023-04-02 15:33:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:33:02,178 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 219 transitions. [2023-04-02 15:33:02,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 15:33:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 219 transitions. [2023-04-02 15:33:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-02 15:33:02,179 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:33:02,180 INFO L195 NwaCegarLoop]: trace histogram [8, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:33:02,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-02 15:33:02,393 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,SelfDestructingSolverStorable12 [2023-04-02 15:33:02,393 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:33:02,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:33:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1203196940, now seen corresponding path program 4 times [2023-04-02 15:33:02,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:33:02,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734598128] [2023-04-02 15:33:02,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:33:02,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:33:02,419 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:33:02,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750654956] [2023-04-02 15:33:02,419 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 15:33:02,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:33:02,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:33:02,420 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) [2023-04-02 15:33:02,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-02 15:33:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 15:33:02,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 15 conjunts are in the unsatisfiable core [2023-04-02 15:33:02,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:33:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 15:33:02,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:33:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 15:33:02,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 15:33:02,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734598128] [2023-04-02 15:33:02,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 15:33:02,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750654956] [2023-04-02 15:33:02,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750654956] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 15:33:02,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1874418609] [2023-04-02 15:33:02,755 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 15:33:02,755 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 15:33:02,755 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 15:33:02,755 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 15:33:02,755 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 15:33:02,774 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 15:33:03,058 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 62 for LOIs [2023-04-02 15:33:03,101 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 24 for LOIs [2023-04-02 15:33:03,104 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 15:33:03,106 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 15:33:03,861 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6842#(and (<= 1 |#StackHeapBarrier|) (<= ~N~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((|v_main_#t~mem13_BEFORE_CALL_42| Int) (v_main_~i~0_BEFORE_CALL_45 Int) (v_main_~a~0.base_BEFORE_CALL_39 Int)) (and (<= (+ v_main_~a~0.base_BEFORE_CALL_39 1) |#StackHeapBarrier|) (<= 1 (+ v_main_~i~0_BEFORE_CALL_45 |#StackHeapBarrier|)) (not (= |v_main_#t~mem13_BEFORE_CALL_42| (+ (* v_main_~i~0_BEFORE_CALL_45 2) ~N~0 (* v_main_~i~0_BEFORE_CALL_45 v_main_~i~0_BEFORE_CALL_45) 1))) (<= ~N~0 (+ 2147483647 v_main_~i~0_BEFORE_CALL_45)) (or (and (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_39) (+ (* (mod v_main_~i~0_BEFORE_CALL_45 4294967296) 8) (- 34359738368))) |v_main_#t~mem13_BEFORE_CALL_42|) (< 2147483647 (mod v_main_~i~0_BEFORE_CALL_45 4294967296))) (and (<= (mod v_main_~i~0_BEFORE_CALL_45 4294967296) 2147483647) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_39) (* (mod v_main_~i~0_BEFORE_CALL_45 4294967296) 8)) |v_main_#t~mem13_BEFORE_CALL_42|))) (<= 0 v_main_~i~0_BEFORE_CALL_45) (< v_main_~i~0_BEFORE_CALL_45 ~N~0) (<= 1 (+ v_main_~i~0_BEFORE_CALL_45 ~N~0)))) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 15:33:03,861 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 15:33:03,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 15:33:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2023-04-02 15:33:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215521132] [2023-04-02 15:33:03,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 15:33:03,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-02 15:33:03,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 15:33:03,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-02 15:33:03,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2023-04-02 15:33:03,863 INFO L87 Difference]: Start difference. First operand 176 states and 219 transitions. Second operand has 25 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 15:33:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 15:33:04,858 INFO L93 Difference]: Finished difference Result 270 states and 322 transitions. [2023-04-02 15:33:04,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-04-02 15:33:04,859 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-04-02 15:33:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 15:33:04,861 INFO L225 Difference]: With dead ends: 270 [2023-04-02 15:33:04,861 INFO L226 Difference]: Without dead ends: 211 [2023-04-02 15:33:04,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=632, Invalid=3400, Unknown=0, NotChecked=0, Total=4032 [2023-04-02 15:33:04,863 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 85 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 15:33:04,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 130 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 15:33:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-04-02 15:33:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 164. [2023-04-02 15:33:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 128 states have (on average 1.1640625) internal successors, (149), 133 states have internal predecessors, (149), 23 states have call successors, (23), 14 states have call predecessors, (23), 12 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2023-04-02 15:33:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2023-04-02 15:33:04,916 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 36 [2023-04-02 15:33:04,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 15:33:04,916 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2023-04-02 15:33:04,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 15:33:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2023-04-02 15:33:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-02 15:33:04,917 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 15:33:04,917 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 15:33:04,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-04-02 15:33:05,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:33:05,124 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 15:33:05,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 15:33:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 55388288, now seen corresponding path program 5 times [2023-04-02 15:33:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 15:33:05,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068381472] [2023-04-02 15:33:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 15:33:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 15:33:05,137 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 15:33:05,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058865696] [2023-04-02 15:33:05,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 15:33:05,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 15:33:05,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 15:33:05,139 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) [2023-04-02 15:33:05,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-04-02 15:33:05,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 15:33:05,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 15:33:05,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 72 conjunts are in the unsatisfiable core [2023-04-02 15:33:05,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 15:33:05,595 INFO L350 Elim1Store]: Elim1 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 [2023-04-02 15:33:05,626 INFO L350 Elim1Store]: Elim1 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 [2023-04-02 15:33:05,659 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-04-02 15:33:05,700 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2023-04-02 15:33:05,776 INFO L350 Elim1Store]: Elim1 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 [2023-04-02 15:33:05,856 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2023-04-02 15:33:05,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 42 [2023-04-02 15:33:06,012 INFO L321 Elim1Store]: treesize reduction 37, result has 21.3 percent of original size [2023-04-02 15:33:06,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 184 [2023-04-02 15:33:06,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 15:33:06,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 15:33:06,049 INFO L321 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2023-04-02 15:33:06,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 212 [2023-04-02 15:33:06,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 15:33:06,308 INFO L321 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2023-04-02 15:33:06,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 122 [2023-04-02 15:33:06,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-04-02 15:33:06,438 INFO L350 Elim1Store]: Elim1 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 310 treesize of output 295 [2023-04-02 15:33:09,135 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:33:09,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 15:33:09,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 15:33:09,140 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:33:09,163 INFO L321 Elim1Store]: treesize reduction 36, result has 28.0 percent of original size [2023-04-02 15:33:09,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 73 treesize of output 39 [2023-04-02 15:33:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 15:33:09,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 15:33:30,262 WARN L223 SmtUtils]: Spent 15.85s on a formula simplification. DAG size of input: 96 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 15:33:33,581 WARN L861 $PredicateComparison]: unable to prove that (or (let ((.cse86 (mod c_main_~i~0 4294967296))) (let ((.cse0 (mod (+ c_main_~i~0 4294967295) 4294967296)) (.cse87 (* .cse86 8))) (let ((.cse19 (+ c_main_~a~0.offset .cse87 (- 34359738368))) (.cse21 (<= .cse86 2147483647)) (.cse4 (+ c_~N~0 9)) (.cse8 (+ c_main_~a~0.offset 16)) (.cse52 (+ c_main_~a~0.offset .cse87)) (.cse22 (< 2147483647 .cse86)) (.cse54 (select |c_#memory_int| c_main_~b~0.base)) (.cse18 (select |c_#memory_int| c_main_~a~0.base)) (.cse53 (* .cse0 8))) (and (or (<= .cse0 2147483647) (let ((.cse20 (+ (select .cse18 (+ c_main_~a~0.offset (- 34359738368) .cse53)) (select .cse54 (+ (- 34359738368) c_main_~b~0.offset .cse53)) 2))) (and (or (let ((.cse5 (store .cse18 .cse19 .cse20))) (let ((.cse7 (select (store |c_#memory_int| c_main_~a~0.base .cse5) c_main_~b~0.base))) (and (forall ((v_z_25 Int)) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse2 (* v_y_25 4294967296))) (let ((.cse1 (* v_y_23 4294967296)) (.cse3 (+ v_z_25 .cse2))) (or (< (+ .cse1 v_z_25 .cse2 1) c_~N~0) (<= 4294967296 .cse3) (= .cse4 (select (let ((.cse6 (* v_z_25 8))) (store .cse5 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse6) (+ (select .cse5 (+ c_main_~a~0.offset .cse6 (- 8))) (select .cse7 (+ .cse6 c_main_~b~0.offset (- 8))) 2))) .cse8)) (<= c_~N~0 (+ .cse1 v_z_25 .cse2)) (< .cse3 0))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse10 (* v_y_20 4294967296))) (let ((.cse9 (+ v_z_20 .cse10)) (.cse11 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse9 1) (< 2147483648 .cse9) (< (+ v_z_20 .cse10 .cse11 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse10 .cse11)) (= .cse4 (select (let ((.cse12 (* v_z_20 8))) (store .cse5 (+ .cse12 c_main_~a~0.offset) (let ((.cse13 (* v_y_20 34359738368))) (+ (select .cse5 (+ .cse12 c_main_~a~0.offset .cse13 (- 8))) 2 (select .cse7 (+ .cse12 .cse13 c_main_~b~0.offset (- 8))))))) .cse8)) (< v_z_20 0))))) (forall ((v_z_25 Int)) (or (<= 1 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse15 (* v_y_25 4294967296))) (let ((.cse14 (* v_y_23 4294967296)) (.cse16 (+ v_z_25 .cse15))) (or (< (+ .cse14 v_z_25 .cse15 1) c_~N~0) (<= 4294967296 .cse16) (= .cse4 (select (let ((.cse17 (* v_z_25 8))) (store .cse5 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse17) (+ (select .cse5 (+ c_main_~a~0.offset .cse17 (- 8))) (select .cse7 (+ .cse17 c_main_~b~0.offset (- 8))) 2))) .cse8)) (<= c_~N~0 (+ .cse14 v_z_25 .cse15)) (< .cse16 0))))) (< v_z_25 0)))))) .cse21) (or .cse22 (let ((.cse23 (= c_main_~i~0 0))) (and (or (not .cse23) (and (forall ((v_ArrVal_1106 (Array Int Int)) (v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse25 (* v_y_20 4294967296))) (let ((.cse24 (+ v_z_20 .cse25)) (.cse26 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse24 1) (< 2147483648 .cse24) (< (+ v_z_20 .cse25 .cse26 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse25 .cse26)) (= .cse4 (select (let ((.cse27 (* v_z_20 8))) (store v_ArrVal_1106 (+ .cse27 c_main_~a~0.offset) (let ((.cse28 (* v_y_20 34359738368))) (+ (select v_ArrVal_1106 (+ .cse27 c_main_~a~0.offset .cse28 (- 8))) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1106) c_main_~b~0.base) (+ .cse27 .cse28 c_main_~b~0.offset (- 8))))))) .cse8)) (< v_z_20 0))))) (forall ((v_z_25 Int) (v_ArrVal_1106 (Array Int Int))) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse30 (* v_y_25 4294967296))) (let ((.cse29 (* v_y_23 4294967296)) (.cse31 (+ v_z_25 .cse30))) (or (< (+ .cse29 v_z_25 .cse30 1) c_~N~0) (<= 4294967296 .cse31) (<= c_~N~0 (+ .cse29 v_z_25 .cse30)) (= .cse4 (select (let ((.cse32 (* v_z_25 8))) (store v_ArrVal_1106 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse32) (+ (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1106) c_main_~b~0.base) (+ .cse32 c_main_~b~0.offset (- 8))) 2 (select v_ArrVal_1106 (+ c_main_~a~0.offset .cse32 (- 8)))))) .cse8)) (< .cse31 0))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_z_25 Int) (v_ArrVal_1106 (Array Int Int))) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse34 (* v_y_25 4294967296))) (let ((.cse33 (* v_y_23 4294967296)) (.cse35 (+ v_z_25 .cse34))) (or (< (+ .cse33 v_z_25 .cse34 1) c_~N~0) (<= 4294967296 .cse35) (<= c_~N~0 (+ .cse33 v_z_25 .cse34)) (= .cse4 (select (let ((.cse36 (* v_z_25 8))) (store v_ArrVal_1106 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse36) (+ (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1106) c_main_~b~0.base) (+ .cse36 c_main_~b~0.offset (- 8))) 2 (select v_ArrVal_1106 (+ c_main_~a~0.offset .cse36 (- 8)))))) .cse8)) (< .cse35 0))))) (<= 1 v_z_25) (< v_z_25 0))))) (or .cse23 (let ((.cse37 (store .cse18 .cse52 .cse20))) (let ((.cse40 (select (store |c_#memory_int| c_main_~a~0.base .cse37) c_main_~b~0.base))) (and (forall ((v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse42 (* v_y_20 4294967296))) (let ((.cse41 (+ v_z_20 .cse42)) (.cse43 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (= .cse4 (select (let ((.cse38 (* v_z_20 8))) (store .cse37 (+ .cse38 c_main_~a~0.offset) (let ((.cse39 (* v_y_20 34359738368))) (+ 2 (select .cse37 (+ .cse38 c_main_~a~0.offset .cse39 (- 8))) (select .cse40 (+ .cse38 .cse39 c_main_~b~0.offset (- 8))))))) .cse8)) (< .cse41 1) (< 2147483648 .cse41) (< (+ v_z_20 .cse42 .cse43 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse42 .cse43)) (< v_z_20 0))))) (forall ((v_z_25 Int)) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse45 (* v_y_25 4294967296))) (let ((.cse44 (* v_y_23 4294967296)) (.cse46 (+ v_z_25 .cse45))) (or (< (+ .cse44 v_z_25 .cse45 1) c_~N~0) (<= 4294967296 .cse46) (<= c_~N~0 (+ .cse44 v_z_25 .cse45)) (= .cse4 (select (let ((.cse47 (* v_z_25 8))) (store .cse37 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse47) (+ (select .cse37 (+ c_main_~a~0.offset .cse47 (- 8))) 2 (select .cse40 (+ .cse47 c_main_~b~0.offset (- 8)))))) .cse8)) (< .cse46 0))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_z_25 Int)) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse49 (* v_y_25 4294967296))) (let ((.cse48 (* v_y_23 4294967296)) (.cse50 (+ v_z_25 .cse49))) (or (< (+ .cse48 v_z_25 .cse49 1) c_~N~0) (<= 4294967296 .cse50) (<= c_~N~0 (+ .cse48 v_z_25 .cse49)) (= .cse4 (select (let ((.cse51 (* v_z_25 8))) (store .cse37 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse51) (+ (select .cse37 (+ c_main_~a~0.offset .cse51 (- 8))) 2 (select .cse40 (+ .cse51 c_main_~b~0.offset (- 8)))))) .cse8)) (< .cse50 0))))) (<= 1 v_z_25) (< v_z_25 0))))))))))))) (or (< 2147483647 .cse0) (let ((.cse70 (+ 2 (select .cse54 (+ c_main_~b~0.offset .cse53)) (select .cse18 (+ c_main_~a~0.offset .cse53))))) (and (or (let ((.cse58 (store .cse18 .cse19 .cse70))) (let ((.cse60 (select (store |c_#memory_int| c_main_~a~0.base .cse58) c_main_~b~0.base))) (and (forall ((v_z_25 Int)) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse56 (* v_y_25 4294967296))) (let ((.cse55 (* v_y_23 4294967296)) (.cse57 (+ v_z_25 .cse56))) (or (< (+ .cse55 v_z_25 .cse56 1) c_~N~0) (<= 4294967296 .cse57) (<= c_~N~0 (+ .cse55 v_z_25 .cse56)) (= .cse4 (select (let ((.cse59 (* v_z_25 8))) (store .cse58 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse59) (+ (select .cse58 (+ c_main_~a~0.offset .cse59 (- 8))) 2 (select .cse60 (+ .cse59 c_main_~b~0.offset (- 8)))))) .cse8)) (< .cse57 0))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse64 (* v_y_20 4294967296))) (let ((.cse63 (+ v_z_20 .cse64)) (.cse65 (* v_y_17 4294967296))) (or (= .cse4 (select (let ((.cse61 (* v_z_20 8))) (store .cse58 (+ .cse61 c_main_~a~0.offset) (let ((.cse62 (* v_y_20 34359738368))) (+ (select .cse60 (+ .cse61 .cse62 c_main_~b~0.offset (- 8))) 2 (select .cse58 (+ .cse61 c_main_~a~0.offset .cse62 (- 8))))))) .cse8)) (<= 4294967296 v_z_20) (< .cse63 1) (< 2147483648 .cse63) (< (+ v_z_20 .cse64 .cse65 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse64 .cse65)) (< v_z_20 0))))) (forall ((v_z_25 Int)) (or (<= 1 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse67 (* v_y_25 4294967296))) (let ((.cse66 (* v_y_23 4294967296)) (.cse68 (+ v_z_25 .cse67))) (or (< (+ .cse66 v_z_25 .cse67 1) c_~N~0) (<= 4294967296 .cse68) (<= c_~N~0 (+ .cse66 v_z_25 .cse67)) (= .cse4 (select (let ((.cse69 (* v_z_25 8))) (store .cse58 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse69) (+ (select .cse58 (+ c_main_~a~0.offset .cse69 (- 8))) 2 (select .cse60 (+ .cse69 c_main_~b~0.offset (- 8)))))) .cse8)) (< .cse68 0))))) (< v_z_25 0)))))) .cse21) (or (let ((.cse74 (store .cse18 .cse52 .cse70))) (let ((.cse76 (select (store |c_#memory_int| c_main_~a~0.base .cse74) c_main_~b~0.base))) (and (forall ((v_z_25 Int)) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse72 (* v_y_25 4294967296))) (let ((.cse71 (* v_y_23 4294967296)) (.cse73 (+ v_z_25 .cse72))) (or (< (+ .cse71 v_z_25 .cse72 1) c_~N~0) (<= 4294967296 .cse73) (<= c_~N~0 (+ .cse71 v_z_25 .cse72)) (< .cse73 0) (= .cse4 (select (let ((.cse75 (* v_z_25 8))) (store .cse74 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse75) (+ (select .cse76 (+ .cse75 c_main_~b~0.offset (- 8))) (select .cse74 (+ c_main_~a~0.offset .cse75 (- 8))) 2))) .cse8)))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_z_25 Int)) (or (<= 1 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse78 (* v_y_25 4294967296))) (let ((.cse77 (* v_y_23 4294967296)) (.cse79 (+ v_z_25 .cse78))) (or (< (+ .cse77 v_z_25 .cse78 1) c_~N~0) (<= 4294967296 .cse79) (<= c_~N~0 (+ .cse77 v_z_25 .cse78)) (< .cse79 0) (= .cse4 (select (let ((.cse80 (* v_z_25 8))) (store .cse74 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse80) (+ (select .cse76 (+ .cse80 c_main_~b~0.offset (- 8))) (select .cse74 (+ c_main_~a~0.offset .cse80 (- 8))) 2))) .cse8)))))) (< v_z_25 0))) (forall ((v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse82 (* v_y_20 4294967296))) (let ((.cse81 (+ v_z_20 .cse82)) (.cse83 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse81 1) (< 2147483648 .cse81) (< (+ v_z_20 .cse82 .cse83 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse82 .cse83)) (= .cse4 (select (let ((.cse84 (* v_z_20 8))) (store .cse74 (+ .cse84 c_main_~a~0.offset) (let ((.cse85 (* v_y_20 34359738368))) (+ (select .cse74 (+ .cse84 c_main_~a~0.offset .cse85 (- 8))) (select .cse76 (+ .cse84 .cse85 c_main_~b~0.offset (- 8))) 2)))) .cse8)) (< v_z_20 0)))))))) .cse22)))))))) (<= c_~N~0 2)) is different from true [2023-04-02 15:33:36,233 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~N~0 2) (let ((.cse1 (+ c_~N~0 9)) (.cse6 (+ c_main_~a~0.offset 16)) (.cse0 (= c_main_~i~0 0))) (and (or (not .cse0) (let ((.cse2 (let ((.cse18 (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset (+ c_~N~0 1)))) (store .cse18 (+ c_main_~a~0.offset 8) (+ c_~N~0 (select (select (store |c_#memory_int| c_main_~a~0.base .cse18) c_main_~b~0.base) c_main_~b~0.offset) 3))))) (let ((.cse5 (select (store |c_#memory_int| c_main_~a~0.base .cse2) c_main_~b~0.base))) (and (forall ((v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse8 (* v_y_20 4294967296))) (let ((.cse7 (+ v_z_20 .cse8)) (.cse9 (* v_y_17 4294967296))) (or (= .cse1 (select (let ((.cse3 (* v_z_20 8))) (store .cse2 (+ .cse3 c_main_~a~0.offset) (let ((.cse4 (* v_y_20 34359738368))) (+ (select .cse2 (+ .cse3 c_main_~a~0.offset .cse4 (- 8))) 2 (select .cse5 (+ .cse3 .cse4 c_main_~b~0.offset (- 8))))))) .cse6)) (<= 4294967296 v_z_20) (< .cse7 1) (< 2147483648 .cse7) (< (+ v_z_20 .cse8 .cse9 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse8 .cse9)) (< v_z_20 0))))) (forall ((v_z_25 Int)) (or (<= v_z_25 2147483648) (<= 4294967296 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse11 (* v_y_25 4294967296))) (let ((.cse10 (* v_y_23 4294967296)) (.cse12 (+ v_z_25 .cse11))) (or (< (+ .cse10 v_z_25 .cse11 1) c_~N~0) (<= 4294967296 .cse12) (<= c_~N~0 (+ .cse10 v_z_25 .cse11)) (= .cse1 (select (let ((.cse13 (* v_z_25 8))) (store .cse2 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse13) (+ 2 (select .cse2 (+ c_main_~a~0.offset .cse13 (- 8))) (select .cse5 (+ .cse13 c_main_~b~0.offset (- 8)))))) .cse6)) (< .cse12 0))))))) (forall ((v_z_25 Int)) (or (<= 1 v_z_25) (< v_z_25 0) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse15 (* v_y_25 4294967296))) (let ((.cse14 (* v_y_23 4294967296)) (.cse16 (+ v_z_25 .cse15))) (or (< (+ .cse14 v_z_25 .cse15 1) c_~N~0) (<= 4294967296 .cse16) (<= c_~N~0 (+ .cse14 v_z_25 .cse15)) (= .cse1 (select (let ((.cse17 (* v_z_25 8))) (store .cse2 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse17) (+ 2 (select .cse2 (+ c_main_~a~0.offset .cse17 (- 8))) (select .cse5 (+ .cse17 c_main_~b~0.offset (- 8)))))) .cse6)) (< .cse16 0))))))))))) (or (let ((.cse107 (+ c_main_~i~0 1))) (let ((.cse109 (mod .cse107 4294967296))) (let ((.cse19 (mod c_main_~i~0 4294967296)) (.cse108 (* .cse109 8))) (let ((.cse20 (<= .cse109 2147483647)) (.cse26 (+ c_main_~a~0.offset .cse108 (- 34359738368))) (.cse40 (< 2147483647 .cse109)) (.cse45 (+ c_main_~a~0.offset .cse108)) (.cse58 (* .cse19 8))) (and (or (< 2147483647 .cse19) (let ((.cse27 (+ c_main_~a~0.offset .cse58)) (.cse28 (+ .cse58 c_main_~b~0.offset))) (and (or .cse20 (and (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse22 (* v_y_25 4294967296))) (let ((.cse21 (* v_y_23 4294967296)) (.cse23 (+ v_z_25 .cse22))) (or (< (+ .cse21 v_z_25 .cse22 1) c_~N~0) (<= 4294967296 .cse23) (<= c_~N~0 (+ .cse21 v_z_25 .cse22)) (< .cse23 0) (= .cse1 (select (let ((.cse24 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse25 (* v_z_25 8))) (store .cse24 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse25) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse24) c_main_~b~0.base) (+ .cse25 c_main_~b~0.offset (- 8))) 2 (select .cse24 (+ c_main_~a~0.offset .cse25 (- 8)))))) .cse6)))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_y_17 Int) (v_ArrVal_1103 (Array Int Int)) (v_z_20 Int) (v_y_20 Int)) (let ((.cse30 (* v_y_20 4294967296))) (let ((.cse29 (+ v_z_20 .cse30)) (.cse31 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse29 1) (< 2147483648 .cse29) (< (+ v_z_20 .cse30 .cse31 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse30 .cse31)) (= .cse1 (select (let ((.cse32 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse33 (* v_z_20 8))) (store .cse32 (+ .cse33 c_main_~a~0.offset) (let ((.cse34 (* v_y_20 34359738368))) (+ 2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse32) c_main_~b~0.base) (+ .cse33 .cse34 c_main_~b~0.offset (- 8))) (select .cse32 (+ .cse33 c_main_~a~0.offset .cse34 (- 8))))))) .cse6)) (< v_z_20 0))))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= 1 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse36 (* v_y_25 4294967296))) (let ((.cse35 (* v_y_23 4294967296)) (.cse37 (+ v_z_25 .cse36))) (or (< (+ .cse35 v_z_25 .cse36 1) c_~N~0) (<= 4294967296 .cse37) (<= c_~N~0 (+ .cse35 v_z_25 .cse36)) (< .cse37 0) (= .cse1 (select (let ((.cse38 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse39 (* v_z_25 8))) (store .cse38 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse39) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse38) c_main_~b~0.base) (+ .cse39 c_main_~b~0.offset (- 8))) 2 (select .cse38 (+ c_main_~a~0.offset .cse39 (- 8)))))) .cse6)))))) (< v_z_25 0))))) (or .cse40 (and (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= 1 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse42 (* v_y_25 4294967296))) (let ((.cse41 (* v_y_23 4294967296)) (.cse46 (+ v_z_25 .cse42))) (or (< (+ .cse41 v_z_25 .cse42 1) c_~N~0) (= .cse1 (select (let ((.cse43 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse44 (* v_z_25 8))) (store .cse43 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse44) (+ 2 (select .cse43 (+ c_main_~a~0.offset .cse44 (- 8))) (select (select (store |c_#memory_int| c_main_~a~0.base .cse43) c_main_~b~0.base) (+ .cse44 c_main_~b~0.offset (- 8)))))) .cse6)) (<= 4294967296 .cse46) (<= c_~N~0 (+ .cse41 v_z_25 .cse42)) (< .cse46 0))))) (< v_z_25 0))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse48 (* v_y_25 4294967296))) (let ((.cse47 (* v_y_23 4294967296)) (.cse51 (+ v_z_25 .cse48))) (or (< (+ .cse47 v_z_25 .cse48 1) c_~N~0) (= .cse1 (select (let ((.cse49 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse50 (* v_z_25 8))) (store .cse49 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse50) (+ 2 (select .cse49 (+ c_main_~a~0.offset .cse50 (- 8))) (select (select (store |c_#memory_int| c_main_~a~0.base .cse49) c_main_~b~0.base) (+ .cse50 c_main_~b~0.offset (- 8)))))) .cse6)) (<= 4294967296 .cse51) (<= c_~N~0 (+ .cse47 v_z_25 .cse48)) (< .cse51 0))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_y_17 Int) (v_ArrVal_1103 (Array Int Int)) (v_z_20 Int) (v_y_20 Int)) (let ((.cse53 (* v_y_20 4294967296))) (let ((.cse52 (+ v_z_20 .cse53)) (.cse54 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse52 1) (< 2147483648 .cse52) (< (+ v_z_20 .cse53 .cse54 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse53 .cse54)) (= .cse1 (select (let ((.cse55 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse56 (* v_z_20 8))) (store .cse55 (+ .cse56 c_main_~a~0.offset) (let ((.cse57 (* v_y_20 34359738368))) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse55) c_main_~b~0.base) (+ .cse56 .cse57 c_main_~b~0.offset (- 8))) (select .cse55 (+ .cse56 c_main_~a~0.offset .cse57 (- 8))) 2)))) .cse6)) (< v_z_20 0)))))))))) (or (<= .cse19 2147483647) (let ((.cse65 (+ c_main_~a~0.offset .cse58 (- 34359738368))) (.cse66 (+ .cse58 (- 34359738368) c_main_~b~0.offset))) (and (or .cse20 (and (forall ((v_y_17 Int) (v_ArrVal_1103 (Array Int Int)) (v_z_20 Int) (v_y_20 Int)) (let ((.cse60 (* v_y_20 4294967296))) (let ((.cse59 (+ v_z_20 .cse60)) (.cse61 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse59 1) (< 2147483648 .cse59) (< (+ v_z_20 .cse60 .cse61 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse60 .cse61)) (= .cse1 (select (let ((.cse62 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse63 (* v_z_20 8))) (store .cse62 (+ .cse63 c_main_~a~0.offset) (let ((.cse64 (* v_y_20 34359738368))) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse62) c_main_~b~0.base) (+ .cse63 .cse64 c_main_~b~0.offset (- 8))) 2 (select .cse62 (+ .cse63 c_main_~a~0.offset .cse64 (- 8))))))) .cse6)) (< v_z_20 0))))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= v_z_25 2147483648) (<= 4294967296 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse70 (* v_y_25 4294967296))) (let ((.cse69 (* v_y_23 4294967296)) (.cse71 (+ v_z_25 .cse70))) (or (= .cse1 (select (let ((.cse67 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse68 (* v_z_25 8))) (store .cse67 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse68) (+ (select .cse67 (+ c_main_~a~0.offset .cse68 (- 8))) 2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse67) c_main_~b~0.base) (+ .cse68 c_main_~b~0.offset (- 8)))))) .cse6)) (< (+ .cse69 v_z_25 .cse70 1) c_~N~0) (<= 4294967296 .cse71) (<= c_~N~0 (+ .cse69 v_z_25 .cse70)) (< .cse71 0))))))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= 1 v_z_25) (< v_z_25 0) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse75 (* v_y_25 4294967296))) (let ((.cse74 (* v_y_23 4294967296)) (.cse76 (+ v_z_25 .cse75))) (or (= .cse1 (select (let ((.cse72 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse73 (* v_z_25 8))) (store .cse72 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse73) (+ (select .cse72 (+ c_main_~a~0.offset .cse73 (- 8))) 2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse72) c_main_~b~0.base) (+ .cse73 c_main_~b~0.offset (- 8)))))) .cse6)) (< (+ .cse74 v_z_25 .cse75 1) c_~N~0) (<= 4294967296 .cse76) (<= c_~N~0 (+ .cse74 v_z_25 .cse75)) (< .cse76 0))))))))) (or .cse40 (let ((.cse77 (= .cse107 0))) (and (or .cse77 (and (forall ((v_y_17 Int) (v_ArrVal_1103 (Array Int Int)) (v_z_20 Int) (v_y_20 Int)) (let ((.cse82 (* v_y_20 4294967296))) (let ((.cse81 (+ v_z_20 .cse82)) (.cse83 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (= .cse1 (select (let ((.cse78 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse79 (* v_z_20 8))) (store .cse78 (+ .cse79 c_main_~a~0.offset) (let ((.cse80 (* v_y_20 34359738368))) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse78) c_main_~b~0.base) (+ .cse79 .cse80 c_main_~b~0.offset (- 8))) 2 (select .cse78 (+ .cse79 c_main_~a~0.offset .cse80 (- 8))))))) .cse6)) (< .cse81 1) (< 2147483648 .cse81) (< (+ v_z_20 .cse82 .cse83 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse82 .cse83)) (< v_z_20 0))))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= 1 v_z_25) (< v_z_25 0) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse87 (* v_y_25 4294967296))) (let ((.cse86 (* v_y_23 4294967296)) (.cse88 (+ v_z_25 .cse87))) (or (= .cse1 (select (let ((.cse84 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse85 (* v_z_25 8))) (store .cse84 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse85) (+ 2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse84) c_main_~b~0.base) (+ .cse85 c_main_~b~0.offset (- 8))) (select .cse84 (+ c_main_~a~0.offset .cse85 (- 8)))))) .cse6)) (< (+ .cse86 v_z_25 .cse87 1) c_~N~0) (<= 4294967296 .cse88) (<= c_~N~0 (+ .cse86 v_z_25 .cse87)) (< .cse88 0))))))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= v_z_25 2147483648) (<= 4294967296 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse92 (* v_y_25 4294967296))) (let ((.cse91 (* v_y_23 4294967296)) (.cse93 (+ v_z_25 .cse92))) (or (= .cse1 (select (let ((.cse89 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse90 (* v_z_25 8))) (store .cse89 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse90) (+ 2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse89) c_main_~b~0.base) (+ .cse90 c_main_~b~0.offset (- 8))) (select .cse89 (+ c_main_~a~0.offset .cse90 (- 8)))))) .cse6)) (< (+ .cse91 v_z_25 .cse92 1) c_~N~0) (<= 4294967296 .cse93) (<= c_~N~0 (+ .cse91 v_z_25 .cse92)) (< .cse93 0))))))))) (or (and (forall ((v_ArrVal_1106 (Array Int Int)) (v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse95 (* v_y_20 4294967296))) (let ((.cse94 (+ v_z_20 .cse95)) (.cse96 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse94 1) (< 2147483648 .cse94) (< (+ v_z_20 .cse95 .cse96 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse95 .cse96)) (= .cse1 (select (let ((.cse97 (* v_z_20 8))) (store v_ArrVal_1106 (+ .cse97 c_main_~a~0.offset) (let ((.cse98 (* v_y_20 34359738368))) (+ (select v_ArrVal_1106 (+ .cse97 c_main_~a~0.offset .cse98 (- 8))) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1106) c_main_~b~0.base) (+ .cse97 .cse98 c_main_~b~0.offset (- 8))))))) .cse6)) (< v_z_20 0))))) (forall ((v_z_25 Int) (v_ArrVal_1106 (Array Int Int))) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse100 (* v_y_25 4294967296))) (let ((.cse99 (* v_y_23 4294967296)) (.cse101 (+ v_z_25 .cse100))) (or (< (+ .cse99 v_z_25 .cse100 1) c_~N~0) (<= 4294967296 .cse101) (<= c_~N~0 (+ .cse99 v_z_25 .cse100)) (= .cse1 (select (let ((.cse102 (* v_z_25 8))) (store v_ArrVal_1106 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse102) (+ (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1106) c_main_~b~0.base) (+ .cse102 c_main_~b~0.offset (- 8))) 2 (select v_ArrVal_1106 (+ c_main_~a~0.offset .cse102 (- 8)))))) .cse6)) (< .cse101 0))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_z_25 Int) (v_ArrVal_1106 (Array Int Int))) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse104 (* v_y_25 4294967296))) (let ((.cse103 (* v_y_23 4294967296)) (.cse105 (+ v_z_25 .cse104))) (or (< (+ .cse103 v_z_25 .cse104 1) c_~N~0) (<= 4294967296 .cse105) (<= c_~N~0 (+ .cse103 v_z_25 .cse104)) (= .cse1 (select (let ((.cse106 (* v_z_25 8))) (store v_ArrVal_1106 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse106) (+ (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1106) c_main_~b~0.base) (+ .cse106 c_main_~b~0.offset (- 8))) 2 (select v_ArrVal_1106 (+ c_main_~a~0.offset .cse106 (- 8)))))) .cse6)) (< .cse105 0))))) (<= 1 v_z_25) (< v_z_25 0)))) (not .cse77))))))))))))) .cse0)))) is different from false [2023-04-02 15:33:38,248 WARN L861 $PredicateComparison]: unable to prove that (or (<= c_~N~0 2) (let ((.cse1 (+ c_~N~0 9)) (.cse6 (+ c_main_~a~0.offset 16)) (.cse0 (= c_main_~i~0 0))) (and (or (not .cse0) (let ((.cse2 (let ((.cse18 (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset (+ c_~N~0 1)))) (store .cse18 (+ c_main_~a~0.offset 8) (+ c_~N~0 (select (select (store |c_#memory_int| c_main_~a~0.base .cse18) c_main_~b~0.base) c_main_~b~0.offset) 3))))) (let ((.cse5 (select (store |c_#memory_int| c_main_~a~0.base .cse2) c_main_~b~0.base))) (and (forall ((v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse8 (* v_y_20 4294967296))) (let ((.cse7 (+ v_z_20 .cse8)) (.cse9 (* v_y_17 4294967296))) (or (= .cse1 (select (let ((.cse3 (* v_z_20 8))) (store .cse2 (+ .cse3 c_main_~a~0.offset) (let ((.cse4 (* v_y_20 34359738368))) (+ (select .cse2 (+ .cse3 c_main_~a~0.offset .cse4 (- 8))) 2 (select .cse5 (+ .cse3 .cse4 c_main_~b~0.offset (- 8))))))) .cse6)) (<= 4294967296 v_z_20) (< .cse7 1) (< 2147483648 .cse7) (< (+ v_z_20 .cse8 .cse9 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse8 .cse9)) (< v_z_20 0))))) (forall ((v_z_25 Int)) (or (<= v_z_25 2147483648) (<= 4294967296 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse11 (* v_y_25 4294967296))) (let ((.cse10 (* v_y_23 4294967296)) (.cse12 (+ v_z_25 .cse11))) (or (< (+ .cse10 v_z_25 .cse11 1) c_~N~0) (<= 4294967296 .cse12) (<= c_~N~0 (+ .cse10 v_z_25 .cse11)) (= .cse1 (select (let ((.cse13 (* v_z_25 8))) (store .cse2 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse13) (+ 2 (select .cse2 (+ c_main_~a~0.offset .cse13 (- 8))) (select .cse5 (+ .cse13 c_main_~b~0.offset (- 8)))))) .cse6)) (< .cse12 0))))))) (forall ((v_z_25 Int)) (or (<= 1 v_z_25) (< v_z_25 0) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse15 (* v_y_25 4294967296))) (let ((.cse14 (* v_y_23 4294967296)) (.cse16 (+ v_z_25 .cse15))) (or (< (+ .cse14 v_z_25 .cse15 1) c_~N~0) (<= 4294967296 .cse16) (<= c_~N~0 (+ .cse14 v_z_25 .cse15)) (= .cse1 (select (let ((.cse17 (* v_z_25 8))) (store .cse2 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse17) (+ 2 (select .cse2 (+ c_main_~a~0.offset .cse17 (- 8))) (select .cse5 (+ .cse17 c_main_~b~0.offset (- 8)))))) .cse6)) (< .cse16 0))))))))))) (or (let ((.cse107 (+ c_main_~i~0 1))) (let ((.cse109 (mod .cse107 4294967296))) (let ((.cse19 (mod c_main_~i~0 4294967296)) (.cse108 (* .cse109 8))) (let ((.cse20 (<= .cse109 2147483647)) (.cse26 (+ c_main_~a~0.offset .cse108 (- 34359738368))) (.cse40 (< 2147483647 .cse109)) (.cse45 (+ c_main_~a~0.offset .cse108)) (.cse58 (* .cse19 8))) (and (or (< 2147483647 .cse19) (let ((.cse27 (+ c_main_~a~0.offset .cse58)) (.cse28 (+ .cse58 c_main_~b~0.offset))) (and (or .cse20 (and (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse22 (* v_y_25 4294967296))) (let ((.cse21 (* v_y_23 4294967296)) (.cse23 (+ v_z_25 .cse22))) (or (< (+ .cse21 v_z_25 .cse22 1) c_~N~0) (<= 4294967296 .cse23) (<= c_~N~0 (+ .cse21 v_z_25 .cse22)) (< .cse23 0) (= .cse1 (select (let ((.cse24 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse25 (* v_z_25 8))) (store .cse24 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse25) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse24) c_main_~b~0.base) (+ .cse25 c_main_~b~0.offset (- 8))) 2 (select .cse24 (+ c_main_~a~0.offset .cse25 (- 8)))))) .cse6)))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_y_17 Int) (v_ArrVal_1103 (Array Int Int)) (v_z_20 Int) (v_y_20 Int)) (let ((.cse30 (* v_y_20 4294967296))) (let ((.cse29 (+ v_z_20 .cse30)) (.cse31 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse29 1) (< 2147483648 .cse29) (< (+ v_z_20 .cse30 .cse31 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse30 .cse31)) (= .cse1 (select (let ((.cse32 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse33 (* v_z_20 8))) (store .cse32 (+ .cse33 c_main_~a~0.offset) (let ((.cse34 (* v_y_20 34359738368))) (+ 2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse32) c_main_~b~0.base) (+ .cse33 .cse34 c_main_~b~0.offset (- 8))) (select .cse32 (+ .cse33 c_main_~a~0.offset .cse34 (- 8))))))) .cse6)) (< v_z_20 0))))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= 1 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse36 (* v_y_25 4294967296))) (let ((.cse35 (* v_y_23 4294967296)) (.cse37 (+ v_z_25 .cse36))) (or (< (+ .cse35 v_z_25 .cse36 1) c_~N~0) (<= 4294967296 .cse37) (<= c_~N~0 (+ .cse35 v_z_25 .cse36)) (< .cse37 0) (= .cse1 (select (let ((.cse38 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse39 (* v_z_25 8))) (store .cse38 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse39) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse38) c_main_~b~0.base) (+ .cse39 c_main_~b~0.offset (- 8))) 2 (select .cse38 (+ c_main_~a~0.offset .cse39 (- 8)))))) .cse6)))))) (< v_z_25 0))))) (or .cse40 (and (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= 1 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse42 (* v_y_25 4294967296))) (let ((.cse41 (* v_y_23 4294967296)) (.cse46 (+ v_z_25 .cse42))) (or (< (+ .cse41 v_z_25 .cse42 1) c_~N~0) (= .cse1 (select (let ((.cse43 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse44 (* v_z_25 8))) (store .cse43 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse44) (+ 2 (select .cse43 (+ c_main_~a~0.offset .cse44 (- 8))) (select (select (store |c_#memory_int| c_main_~a~0.base .cse43) c_main_~b~0.base) (+ .cse44 c_main_~b~0.offset (- 8)))))) .cse6)) (<= 4294967296 .cse46) (<= c_~N~0 (+ .cse41 v_z_25 .cse42)) (< .cse46 0))))) (< v_z_25 0))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse48 (* v_y_25 4294967296))) (let ((.cse47 (* v_y_23 4294967296)) (.cse51 (+ v_z_25 .cse48))) (or (< (+ .cse47 v_z_25 .cse48 1) c_~N~0) (= .cse1 (select (let ((.cse49 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse50 (* v_z_25 8))) (store .cse49 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse50) (+ 2 (select .cse49 (+ c_main_~a~0.offset .cse50 (- 8))) (select (select (store |c_#memory_int| c_main_~a~0.base .cse49) c_main_~b~0.base) (+ .cse50 c_main_~b~0.offset (- 8)))))) .cse6)) (<= 4294967296 .cse51) (<= c_~N~0 (+ .cse47 v_z_25 .cse48)) (< .cse51 0))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_y_17 Int) (v_ArrVal_1103 (Array Int Int)) (v_z_20 Int) (v_y_20 Int)) (let ((.cse53 (* v_y_20 4294967296))) (let ((.cse52 (+ v_z_20 .cse53)) (.cse54 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse52 1) (< 2147483648 .cse52) (< (+ v_z_20 .cse53 .cse54 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse53 .cse54)) (= .cse1 (select (let ((.cse55 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse27) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse28) 2))) (.cse56 (* v_z_20 8))) (store .cse55 (+ .cse56 c_main_~a~0.offset) (let ((.cse57 (* v_y_20 34359738368))) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse55) c_main_~b~0.base) (+ .cse56 .cse57 c_main_~b~0.offset (- 8))) (select .cse55 (+ .cse56 c_main_~a~0.offset .cse57 (- 8))) 2)))) .cse6)) (< v_z_20 0)))))))))) (or (<= .cse19 2147483647) (let ((.cse65 (+ c_main_~a~0.offset .cse58 (- 34359738368))) (.cse66 (+ .cse58 (- 34359738368) c_main_~b~0.offset))) (and (or .cse20 (and (forall ((v_y_17 Int) (v_ArrVal_1103 (Array Int Int)) (v_z_20 Int) (v_y_20 Int)) (let ((.cse60 (* v_y_20 4294967296))) (let ((.cse59 (+ v_z_20 .cse60)) (.cse61 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse59 1) (< 2147483648 .cse59) (< (+ v_z_20 .cse60 .cse61 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse60 .cse61)) (= .cse1 (select (let ((.cse62 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse63 (* v_z_20 8))) (store .cse62 (+ .cse63 c_main_~a~0.offset) (let ((.cse64 (* v_y_20 34359738368))) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse62) c_main_~b~0.base) (+ .cse63 .cse64 c_main_~b~0.offset (- 8))) 2 (select .cse62 (+ .cse63 c_main_~a~0.offset .cse64 (- 8))))))) .cse6)) (< v_z_20 0))))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= v_z_25 2147483648) (<= 4294967296 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse70 (* v_y_25 4294967296))) (let ((.cse69 (* v_y_23 4294967296)) (.cse71 (+ v_z_25 .cse70))) (or (= .cse1 (select (let ((.cse67 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse68 (* v_z_25 8))) (store .cse67 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse68) (+ (select .cse67 (+ c_main_~a~0.offset .cse68 (- 8))) 2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse67) c_main_~b~0.base) (+ .cse68 c_main_~b~0.offset (- 8)))))) .cse6)) (< (+ .cse69 v_z_25 .cse70 1) c_~N~0) (<= 4294967296 .cse71) (<= c_~N~0 (+ .cse69 v_z_25 .cse70)) (< .cse71 0))))))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= 1 v_z_25) (< v_z_25 0) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse75 (* v_y_25 4294967296))) (let ((.cse74 (* v_y_23 4294967296)) (.cse76 (+ v_z_25 .cse75))) (or (= .cse1 (select (let ((.cse72 (store v_ArrVal_1103 .cse26 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse73 (* v_z_25 8))) (store .cse72 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse73) (+ (select .cse72 (+ c_main_~a~0.offset .cse73 (- 8))) 2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse72) c_main_~b~0.base) (+ .cse73 c_main_~b~0.offset (- 8)))))) .cse6)) (< (+ .cse74 v_z_25 .cse75 1) c_~N~0) (<= 4294967296 .cse76) (<= c_~N~0 (+ .cse74 v_z_25 .cse75)) (< .cse76 0))))))))) (or .cse40 (let ((.cse77 (= .cse107 0))) (and (or .cse77 (and (forall ((v_y_17 Int) (v_ArrVal_1103 (Array Int Int)) (v_z_20 Int) (v_y_20 Int)) (let ((.cse82 (* v_y_20 4294967296))) (let ((.cse81 (+ v_z_20 .cse82)) (.cse83 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (= .cse1 (select (let ((.cse78 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse79 (* v_z_20 8))) (store .cse78 (+ .cse79 c_main_~a~0.offset) (let ((.cse80 (* v_y_20 34359738368))) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse78) c_main_~b~0.base) (+ .cse79 .cse80 c_main_~b~0.offset (- 8))) 2 (select .cse78 (+ .cse79 c_main_~a~0.offset .cse80 (- 8))))))) .cse6)) (< .cse81 1) (< 2147483648 .cse81) (< (+ v_z_20 .cse82 .cse83 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse82 .cse83)) (< v_z_20 0))))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= 1 v_z_25) (< v_z_25 0) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse87 (* v_y_25 4294967296))) (let ((.cse86 (* v_y_23 4294967296)) (.cse88 (+ v_z_25 .cse87))) (or (= .cse1 (select (let ((.cse84 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse85 (* v_z_25 8))) (store .cse84 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse85) (+ 2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse84) c_main_~b~0.base) (+ .cse85 c_main_~b~0.offset (- 8))) (select .cse84 (+ c_main_~a~0.offset .cse85 (- 8)))))) .cse6)) (< (+ .cse86 v_z_25 .cse87 1) c_~N~0) (<= 4294967296 .cse88) (<= c_~N~0 (+ .cse86 v_z_25 .cse87)) (< .cse88 0))))))) (forall ((v_z_25 Int) (v_ArrVal_1103 (Array Int Int))) (or (<= v_z_25 2147483648) (<= 4294967296 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse92 (* v_y_25 4294967296))) (let ((.cse91 (* v_y_23 4294967296)) (.cse93 (+ v_z_25 .cse92))) (or (= .cse1 (select (let ((.cse89 (store v_ArrVal_1103 .cse45 (+ (select v_ArrVal_1103 .cse65) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1103) c_main_~b~0.base) .cse66)))) (.cse90 (* v_z_25 8))) (store .cse89 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse90) (+ 2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse89) c_main_~b~0.base) (+ .cse90 c_main_~b~0.offset (- 8))) (select .cse89 (+ c_main_~a~0.offset .cse90 (- 8)))))) .cse6)) (< (+ .cse91 v_z_25 .cse92 1) c_~N~0) (<= 4294967296 .cse93) (<= c_~N~0 (+ .cse91 v_z_25 .cse92)) (< .cse93 0))))))))) (or (and (forall ((v_ArrVal_1106 (Array Int Int)) (v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse95 (* v_y_20 4294967296))) (let ((.cse94 (+ v_z_20 .cse95)) (.cse96 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (< .cse94 1) (< 2147483648 .cse94) (< (+ v_z_20 .cse95 .cse96 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse95 .cse96)) (= .cse1 (select (let ((.cse97 (* v_z_20 8))) (store v_ArrVal_1106 (+ .cse97 c_main_~a~0.offset) (let ((.cse98 (* v_y_20 34359738368))) (+ (select v_ArrVal_1106 (+ .cse97 c_main_~a~0.offset .cse98 (- 8))) 2 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1106) c_main_~b~0.base) (+ .cse97 .cse98 c_main_~b~0.offset (- 8))))))) .cse6)) (< v_z_20 0))))) (forall ((v_z_25 Int) (v_ArrVal_1106 (Array Int Int))) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse100 (* v_y_25 4294967296))) (let ((.cse99 (* v_y_23 4294967296)) (.cse101 (+ v_z_25 .cse100))) (or (< (+ .cse99 v_z_25 .cse100 1) c_~N~0) (<= 4294967296 .cse101) (<= c_~N~0 (+ .cse99 v_z_25 .cse100)) (= .cse1 (select (let ((.cse102 (* v_z_25 8))) (store v_ArrVal_1106 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse102) (+ (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1106) c_main_~b~0.base) (+ .cse102 c_main_~b~0.offset (- 8))) 2 (select v_ArrVal_1106 (+ c_main_~a~0.offset .cse102 (- 8)))))) .cse6)) (< .cse101 0))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25))) (forall ((v_z_25 Int) (v_ArrVal_1106 (Array Int Int))) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse104 (* v_y_25 4294967296))) (let ((.cse103 (* v_y_23 4294967296)) (.cse105 (+ v_z_25 .cse104))) (or (< (+ .cse103 v_z_25 .cse104 1) c_~N~0) (<= 4294967296 .cse105) (<= c_~N~0 (+ .cse103 v_z_25 .cse104)) (= .cse1 (select (let ((.cse106 (* v_z_25 8))) (store v_ArrVal_1106 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse106) (+ (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1106) c_main_~b~0.base) (+ .cse106 c_main_~b~0.offset (- 8))) 2 (select v_ArrVal_1106 (+ c_main_~a~0.offset .cse106 (- 8)))))) .cse6)) (< .cse105 0))))) (<= 1 v_z_25) (< v_z_25 0)))) (not .cse77))))))))))))) .cse0)))) is different from true [2023-04-02 15:33:49,090 WARN L223 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 15:34:06,354 WARN L223 SmtUtils]: Spent 11.79s on a formula simplification that was a NOOP. DAG size: 140 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 15:34:11,792 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~i~0 1))) (or (<= c_~N~0 2) (<= c_~N~0 .cse0) (let ((.cse68 (mod .cse0 4294967296)) (.cse67 (mod c_main_~i~0 4294967296))) (let ((.cse1 (mod (+ c_main_~i~0 4294967295) 4294967296)) (.cse66 (* .cse67 8)) (.cse65 (* .cse68 8))) (let ((.cse2 (<= .cse67 2147483647)) (.cse29 (<= .cse68 2147483647)) (.cse13 (+ .cse65 (- 34359738368) c_main_~b~0.offset)) (.cse28 (< 2147483647 .cse68)) (.cse11 (+ .cse66 (- 34359738368) c_main_~b~0.offset)) (.cse39 (< 2147483647 .cse67)) (.cse3 (+ c_~N~0 9)) (.cse8 (+ c_main_~a~0.offset 8)) (.cse9 (+ c_~N~0 1)) (.cse38 (+ .cse66 c_main_~b~0.offset)) (.cse24 (+ .cse65 c_main_~b~0.offset)) (.cse14 (+ c_main_~a~0.offset 16)) (.cse10 (select |c_#memory_int| c_main_~b~0.base)) (.cse40 (* .cse1 8))) (and (or (< 2147483647 .cse1) (let ((.cse12 (+ 2 (select .cse10 (+ c_main_~b~0.offset .cse40))))) (and (or .cse2 (forall ((v_z_25 Int) (v_ArrVal_1099 Int)) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse16 (* v_y_25 4294967296))) (let ((.cse15 (* v_y_23 4294967296)) (.cse17 (+ v_z_25 .cse16))) (or (= .cse3 (select (let ((.cse6 (store |c_#memory_int| c_main_~b~0.base (store (store .cse10 .cse11 .cse12) .cse13 v_ArrVal_1099)))) (let ((.cse4 (let ((.cse7 (store (select .cse6 c_main_~a~0.base) c_main_~a~0.offset .cse9))) (store .cse7 .cse8 (+ c_~N~0 3 (select (select (store .cse6 c_main_~a~0.base .cse7) c_main_~b~0.base) c_main_~b~0.offset))))) (.cse5 (* v_z_25 8))) (store .cse4 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse5) (+ (select (select (store .cse6 c_main_~a~0.base .cse4) c_main_~b~0.base) (+ .cse5 c_main_~b~0.offset (- 8))) (select .cse4 (+ c_main_~a~0.offset .cse5 (- 8))) 2)))) .cse14)) (< (+ .cse15 v_z_25 .cse16 1) c_~N~0) (<= 4294967296 .cse17) (<= c_~N~0 (+ .cse15 v_z_25 .cse16)) (< .cse17 0))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25)))) (or (let ((.cse23 (store .cse10 .cse38 .cse12))) (and (or (forall ((v_ArrVal_1099 Int) (v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse26 (* v_y_20 4294967296))) (let ((.cse25 (+ v_z_20 .cse26)) (.cse27 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (= .cse3 (select (let ((.cse21 (store |c_#memory_int| c_main_~b~0.base (store .cse23 .cse24 v_ArrVal_1099)))) (let ((.cse18 (let ((.cse22 (store (select .cse21 c_main_~a~0.base) c_main_~a~0.offset .cse9))) (store .cse22 .cse8 (+ c_~N~0 3 (select (select (store .cse21 c_main_~a~0.base .cse22) c_main_~b~0.base) c_main_~b~0.offset))))) (.cse19 (* v_z_20 8))) (store .cse18 (+ .cse19 c_main_~a~0.offset) (let ((.cse20 (* v_y_20 34359738368))) (+ 2 (select .cse18 (+ .cse19 c_main_~a~0.offset .cse20 (- 8))) (select (select (store .cse21 c_main_~a~0.base .cse18) c_main_~b~0.base) (+ .cse19 .cse20 c_main_~b~0.offset (- 8)))))))) .cse14)) (< .cse25 1) (< 2147483648 .cse25) (< (+ v_z_20 .cse26 .cse27 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse26 .cse27)) (< v_z_20 0))))) .cse28) (or .cse29 (forall ((v_ArrVal_1099 Int) (v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse36 (* v_y_20 4294967296))) (let ((.cse35 (+ v_z_20 .cse36)) (.cse37 (* v_y_17 4294967296))) (or (= .cse3 (select (let ((.cse33 (store |c_#memory_int| c_main_~b~0.base (store .cse23 .cse13 v_ArrVal_1099)))) (let ((.cse30 (let ((.cse34 (store (select .cse33 c_main_~a~0.base) c_main_~a~0.offset .cse9))) (store .cse34 .cse8 (+ c_~N~0 3 (select (select (store .cse33 c_main_~a~0.base .cse34) c_main_~b~0.base) c_main_~b~0.offset))))) (.cse31 (* v_z_20 8))) (store .cse30 (+ .cse31 c_main_~a~0.offset) (let ((.cse32 (* v_y_20 34359738368))) (+ (select .cse30 (+ .cse31 c_main_~a~0.offset .cse32 (- 8))) (select (select (store .cse33 c_main_~a~0.base .cse30) c_main_~b~0.base) (+ .cse31 .cse32 c_main_~b~0.offset (- 8))) 2))))) .cse14)) (<= 4294967296 v_z_20) (< .cse35 1) (< 2147483648 .cse35) (< (+ v_z_20 .cse36 .cse37 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse36 .cse37)) (< v_z_20 0)))))))) .cse39)))) (or (let ((.cse56 (+ (select .cse10 (+ (- 34359738368) c_main_~b~0.offset .cse40)) 2))) (and (or .cse2 (let ((.cse48 (store .cse10 .cse11 .cse56))) (and (or .cse29 (forall ((v_z_25 Int) (v_ArrVal_1099 Int)) (or (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse42 (* v_y_25 4294967296))) (let ((.cse41 (* v_y_23 4294967296)) (.cse43 (+ v_z_25 .cse42))) (or (< (+ .cse41 v_z_25 .cse42 1) c_~N~0) (<= 4294967296 .cse43) (= .cse3 (select (let ((.cse46 (store |c_#memory_int| c_main_~b~0.base (store .cse48 .cse13 v_ArrVal_1099)))) (let ((.cse44 (let ((.cse47 (store (select .cse46 c_main_~a~0.base) c_main_~a~0.offset .cse9))) (store .cse47 .cse8 (+ c_~N~0 3 (select (select (store .cse46 c_main_~a~0.base .cse47) c_main_~b~0.base) c_main_~b~0.offset))))) (.cse45 (* v_z_25 8))) (store .cse44 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse45) (+ (select (select (store .cse46 c_main_~a~0.base .cse44) c_main_~b~0.base) (+ .cse45 c_main_~b~0.offset (- 8))) 2 (select .cse44 (+ c_main_~a~0.offset .cse45 (- 8))))))) .cse14)) (<= c_~N~0 (+ .cse41 v_z_25 .cse42)) (< .cse43 0))))) (<= v_z_25 2147483648) (<= 4294967296 v_z_25)))) (or (forall ((v_z_25 Int) (v_ArrVal_1099 Int)) (or (<= 1 v_z_25) (forall ((v_y_23 Int) (v_y_25 Int)) (let ((.cse50 (* v_y_25 4294967296))) (let ((.cse49 (* v_y_23 4294967296)) (.cse51 (+ v_z_25 .cse50))) (or (< (+ .cse49 v_z_25 .cse50 1) c_~N~0) (<= 4294967296 .cse51) (= .cse3 (select (let ((.cse54 (store |c_#memory_int| c_main_~b~0.base (store .cse48 .cse24 v_ArrVal_1099)))) (let ((.cse52 (let ((.cse55 (store (select .cse54 c_main_~a~0.base) c_main_~a~0.offset .cse9))) (store .cse55 .cse8 (+ c_~N~0 3 (select (select (store .cse54 c_main_~a~0.base .cse55) c_main_~b~0.base) c_main_~b~0.offset))))) (.cse53 (* v_z_25 8))) (store .cse52 (+ c_main_~a~0.offset (* v_y_25 34359738368) .cse53) (+ (select (select (store .cse54 c_main_~a~0.base .cse52) c_main_~b~0.base) (+ .cse53 c_main_~b~0.offset (- 8))) 2 (select .cse52 (+ c_main_~a~0.offset .cse53 (- 8))))))) .cse14)) (<= c_~N~0 (+ .cse49 v_z_25 .cse50)) (< .cse51 0))))) (< v_z_25 0))) .cse28)))) (or .cse39 (forall ((v_ArrVal_1099 Int) (v_y_17 Int) (v_z_20 Int) (v_y_20 Int)) (let ((.cse63 (* v_y_20 4294967296))) (let ((.cse62 (+ v_z_20 .cse63)) (.cse64 (* v_y_17 4294967296))) (or (<= 4294967296 v_z_20) (= .cse3 (select (let ((.cse60 (store |c_#memory_int| c_main_~b~0.base (store (store .cse10 .cse38 .cse56) .cse24 v_ArrVal_1099)))) (let ((.cse57 (let ((.cse61 (store (select .cse60 c_main_~a~0.base) c_main_~a~0.offset .cse9))) (store .cse61 .cse8 (+ c_~N~0 3 (select (select (store .cse60 c_main_~a~0.base .cse61) c_main_~b~0.base) c_main_~b~0.offset))))) (.cse58 (* v_z_20 8))) (store .cse57 (+ .cse58 c_main_~a~0.offset) (let ((.cse59 (* v_y_20 34359738368))) (+ 2 (select .cse57 (+ .cse58 c_main_~a~0.offset .cse59 (- 8))) (select (select (store .cse60 c_main_~a~0.base .cse57) c_main_~b~0.base) (+ .cse58 .cse59 c_main_~b~0.offset (- 8)))))))) .cse14)) (< .cse62 1) (< 2147483648 .cse62) (< (+ v_z_20 .cse63 .cse64 1) c_~N~0) (<= c_~N~0 (+ v_z_20 .cse63 .cse64)) (< v_z_20 0)))))))) (<= .cse1 2147483647)))))) (< (+ c_main_~i~0 2) c_~N~0))) is different from true [2023-04-02 15:34:12,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:34:12,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 47 [2023-04-02 15:34:12,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:34:12,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-04-02 15:34:17,227 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:34:17,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:34:17,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 498 treesize of output 203 [2023-04-02 15:34:17,544 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:34:17,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:34:17,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 491 treesize of output 205 [2023-04-02 15:34:18,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:34:18,337 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:34:18,337 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:34:18,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:34:18,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 481 treesize of output 204 [2023-04-02 15:34:18,817 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:34:18,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:34:18,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 498 treesize of output 203 [2023-04-02 15:34:19,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:34:19,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:34:19,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:34:19,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:34:19,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 508 treesize of output 204 [2023-04-02 15:34:19,462 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:34:19,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:34:19,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 491 treesize of output 205 [2023-04-02 15:34:58,940 WARN L223 SmtUtils]: Spent 38.90s on a formula simplification. DAG size of input: 30 DAG size of output: 27 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-04-02 15:34:58,941 INFO L321 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2023-04-02 15:34:58,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 79944 treesize of output 59877 [2023-04-02 15:34:59,329 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:35:10,700 WARN L223 SmtUtils]: Spent 11.37s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-04-02 15:35:10,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:35:10,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 4924 treesize of output 4836 [2023-04-02 15:35:10,967 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 15:35:22,918 WARN L223 SmtUtils]: Spent 11.94s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-04-02 15:35:22,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 15:35:22,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 4114 treesize of output 4134 [2023-04-02 15:35:58,659 WARN L223 SmtUtils]: Spent 35.47s on a formula simplification. DAG size of input: 96 DAG size of output: 91 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-04-02 15:35:58,660 INFO L321 Elim1Store]: treesize reduction 12, result has 94.1 percent of original size [2023-04-02 15:35:58,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 6195 treesize of output 5772 [2023-04-02 15:35:59,045 INFO L173 IndexEqualityManager]: detected equality via solver