./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array11_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array11_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 20:10:07,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 20:10:07,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 20:10:07,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 20:10:07,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 20:10:07,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 20:10:07,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 20:10:07,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 20:10:07,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 20:10:07,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 20:10:07,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 20:10:07,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 20:10:07,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 20:10:07,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 20:10:07,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 20:10:07,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 20:10:07,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 20:10:07,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 20:10:07,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 20:10:07,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 20:10:07,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 20:10:07,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 20:10:07,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 20:10:07,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 20:10:08,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 20:10:08,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 20:10:08,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 20:10:08,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 20:10:08,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 20:10:08,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 20:10:08,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 20:10:08,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 20:10:08,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 20:10:08,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 20:10:08,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 20:10:08,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 20:10:08,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 20:10:08,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 20:10:08,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 20:10:08,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 20:10:08,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 20:10:08,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 20:10:08,052 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 20:10:08,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 20:10:08,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 20:10:08,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 20:10:08,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 20:10:08,058 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 20:10:08,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 20:10:08,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 20:10:08,059 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 20:10:08,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 20:10:08,060 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 20:10:08,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 20:10:08,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 20:10:08,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 20:10:08,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 20:10:08,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 20:10:08,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 20:10:08,061 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 20:10:08,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 20:10:08,062 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 20:10:08,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 20:10:08,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 20:10:08,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 20:10:08,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 20:10:08,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 20:10:08,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 20:10:08,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 20:10:08,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 20:10:08,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 20:10:08,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 20:10:08,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 20:10:08,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 20:10:08,065 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 20:10:08,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 20:10:08,065 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 20:10:08,065 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb [2023-02-17 20:10:08,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 20:10:08,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 20:10:08,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 20:10:08,327 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 20:10:08,328 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 20:10:08,330 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array11_pattern.c [2023-02-17 20:10:09,525 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 20:10:09,704 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 20:10:09,705 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array11_pattern.c [2023-02-17 20:10:09,710 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3bf4e454/9f51ca3d12434897898c4056643e9e1a/FLAG96f7ffae7 [2023-02-17 20:10:09,724 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3bf4e454/9f51ca3d12434897898c4056643e9e1a [2023-02-17 20:10:09,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 20:10:09,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 20:10:09,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 20:10:09,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 20:10:09,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 20:10:09,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:09,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc8faa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09, skipping insertion in model container [2023-02-17 20:10:09,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:09,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 20:10:09,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 20:10:09,898 WARN L237 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-patterns/array11_pattern.c[1357,1370] [2023-02-17 20:10:09,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 20:10:09,941 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 20:10:09,952 WARN L237 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-patterns/array11_pattern.c[1357,1370] [2023-02-17 20:10:09,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 20:10:09,986 INFO L208 MainTranslator]: Completed translation [2023-02-17 20:10:09,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09 WrapperNode [2023-02-17 20:10:09,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 20:10:09,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 20:10:09,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 20:10:09,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 20:10:09,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,044 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2023-02-17 20:10:10,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 20:10:10,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 20:10:10,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 20:10:10,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 20:10:10,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,072 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 20:10:10,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 20:10:10,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 20:10:10,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 20:10:10,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (1/1) ... [2023-02-17 20:10:10,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 20:10:10,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 20:10:10,110 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-02-17 20:10:10,116 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-02-17 20:10:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 20:10:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 20:10:10,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 20:10:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 20:10:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 20:10:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 20:10:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 20:10:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 20:10:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 20:10:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 20:10:10,202 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 20:10:10,204 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 20:10:10,408 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 20:10:10,413 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 20:10:10,428 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-17 20:10:10,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:10:10 BoogieIcfgContainer [2023-02-17 20:10:10,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 20:10:10,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 20:10:10,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 20:10:10,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 20:10:10,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:10:09" (1/3) ... [2023-02-17 20:10:10,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e1dc06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:10:10, skipping insertion in model container [2023-02-17 20:10:10,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:10:09" (2/3) ... [2023-02-17 20:10:10,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e1dc06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:10:10, skipping insertion in model container [2023-02-17 20:10:10,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:10:10" (3/3) ... [2023-02-17 20:10:10,439 INFO L112 eAbstractionObserver]: Analyzing ICFG array11_pattern.c [2023-02-17 20:10:10,455 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 20:10:10,469 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 20:10:10,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 20:10:10,551 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c1a0b39, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 20:10:10,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 20:10:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:10:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 20:10:10,564 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 20:10:10,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 20:10:10,568 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 20:10:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 20:10:10,575 INFO L85 PathProgramCache]: Analyzing trace with hash -800294020, now seen corresponding path program 1 times [2023-02-17 20:10:10,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 20:10:10,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930096563] [2023-02-17 20:10:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:10:10,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 20:10:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 20:10:10,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 20:10:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 20:10:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 20:10:10,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 20:10:10,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930096563] [2023-02-17 20:10:10,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930096563] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 20:10:10,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 20:10:10,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 20:10:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140426829] [2023-02-17 20:10:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 20:10:10,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 20:10:10,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 20:10:10,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 20:10:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 20:10:10,832 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 20:10:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 20:10:10,849 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2023-02-17 20:10:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 20:10:10,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-17 20:10:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 20:10:10,860 INFO L225 Difference]: With dead ends: 47 [2023-02-17 20:10:10,860 INFO L226 Difference]: Without dead ends: 21 [2023-02-17 20:10:10,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 20:10:10,871 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 20:10:10,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 20:10:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-17 20:10:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-17 20:10:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:10:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-02-17 20:10:10,898 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2023-02-17 20:10:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 20:10:10,899 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-02-17 20:10:10,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 20:10:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-02-17 20:10:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 20:10:10,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 20:10:10,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 20:10:10,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 20:10:10,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 20:10:10,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 20:10:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash -952637313, now seen corresponding path program 1 times [2023-02-17 20:10:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 20:10:10,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613868599] [2023-02-17 20:10:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:10:10,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 20:10:10,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 20:10:10,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1631392518] [2023-02-17 20:10:10,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:10:10,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 20:10:10,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 20:10:10,937 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-02-17 20:10:10,941 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-02-17 20:10:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 20:10:11,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 20:10:11,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 20:10:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 20:10:11,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 20:10:11,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 20:10:11,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613868599] [2023-02-17 20:10:11,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 20:10:11,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631392518] [2023-02-17 20:10:11,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631392518] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 20:10:11,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 20:10:11,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 20:10:11,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114884635] [2023-02-17 20:10:11,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 20:10:11,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 20:10:11,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 20:10:11,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 20:10:11,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 20:10:11,098 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:10:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 20:10:11,115 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-02-17 20:10:11,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 20:10:11,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-02-17 20:10:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 20:10:11,117 INFO L225 Difference]: With dead ends: 26 [2023-02-17 20:10:11,117 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 20:10:11,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 20:10:11,119 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 20:10:11,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 20:10:11,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 20:10:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-17 20:10:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:10:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-02-17 20:10:11,125 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 22 [2023-02-17 20:10:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 20:10:11,126 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-02-17 20:10:11,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:10:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-02-17 20:10:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 20:10:11,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 20:10:11,128 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 20:10:11,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 20:10:11,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 20:10:11,334 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 20:10:11,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 20:10:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash -603190335, now seen corresponding path program 1 times [2023-02-17 20:10:11,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 20:10:11,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945413392] [2023-02-17 20:10:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:10:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 20:10:11,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 20:10:11,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462310536] [2023-02-17 20:10:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:10:11,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 20:10:11,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 20:10:11,370 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-02-17 20:10:11,373 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-02-17 20:10:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 20:10:11,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 20:10:11,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 20:10:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 20:10:11,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 20:10:11,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 20:10:11,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945413392] [2023-02-17 20:10:11,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 20:10:11,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462310536] [2023-02-17 20:10:11,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462310536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 20:10:11,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 20:10:11,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 20:10:11,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026701665] [2023-02-17 20:10:11,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 20:10:11,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 20:10:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 20:10:11,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 20:10:11,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 20:10:11,497 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:10:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 20:10:11,848 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-02-17 20:10:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 20:10:11,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-17 20:10:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 20:10:11,850 INFO L225 Difference]: With dead ends: 41 [2023-02-17 20:10:11,850 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 20:10:11,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-17 20:10:11,851 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 20:10:11,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 20:10:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 20:10:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-02-17 20:10:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:10:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-02-17 20:10:11,858 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 24 [2023-02-17 20:10:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 20:10:11,858 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-02-17 20:10:11,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:10:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-02-17 20:10:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 20:10:11,859 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 20:10:11,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 20:10:11,869 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-02-17 20:10:12,059 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,SelfDestructingSolverStorable2 [2023-02-17 20:10:12,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 20:10:12,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 20:10:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1366149955, now seen corresponding path program 1 times [2023-02-17 20:10:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 20:10:12,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214448153] [2023-02-17 20:10:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:10:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 20:10:12,081 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 20:10:12,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352247033] [2023-02-17 20:10:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:10:12,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 20:10:12,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 20:10:12,083 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-02-17 20:10:12,092 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-02-17 20:10:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 20:10:12,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-17 20:10:12,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 20:10:12,269 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-02-17 20:10:12,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:12,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2023-02-17 20:10:12,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-02-17 20:10:12,303 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 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-17 20:10:12,310 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 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-17 20:10:12,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:12,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 20:10:12,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 277 [2023-02-17 20:10:12,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:12,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 356 [2023-02-17 20:10:12,919 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:12,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:12,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 1374 [2023-02-17 20:10:12,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,010 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 1428 [2023-02-17 20:10:13,124 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 356 [2023-02-17 20:10:13,178 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 118 treesize of output 169 [2023-02-17 20:10:13,199 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:13,251 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:13,269 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,270 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 356 [2023-02-17 20:10:13,295 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:13,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:13,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 118 treesize of output 169 [2023-02-17 20:10:13,362 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:13,366 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:13,368 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:13,370 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:13,421 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 356 [2023-02-17 20:10:13,627 INFO L217 Elim1Store]: Index analysis took 113 ms [2023-02-17 20:10:13,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 946 [2023-02-17 20:10:13,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 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 292 treesize of output 689 [2023-02-17 20:10:13,802 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:13,859 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 356 [2023-02-17 20:10:13,920 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:13,949 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:13,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 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 160 treesize of output 419 [2023-02-17 20:10:13,987 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:14,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:14,016 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:14,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 356 [2023-02-17 20:10:14,043 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:14,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:14,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:14,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 118 treesize of output 186 [2023-02-17 20:10:14,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 530 [2023-02-17 20:10:14,182 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:14,185 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:14,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 364 [2023-02-17 20:10:14,226 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:14,260 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:14,281 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:14,284 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:14,318 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:14,319 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:14,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 364 [2023-02-17 20:10:14,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:14,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:14,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:14,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 403 treesize of output 971 [2023-02-17 20:10:14,642 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:14,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:14,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 18 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 1835 treesize of output 23312 [2023-02-17 20:10:16,472 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:16,697 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:16,699 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:16,702 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:16,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 530 treesize of output 1390 [2023-02-17 20:10:17,350 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:17,360 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:17,391 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:17,400 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:17,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 17 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 907 treesize of output 12556 [2023-02-17 20:10:18,711 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:18,728 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:18,736 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:18,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:18,743 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:18,743 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:18,744 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:18,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:18,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:18,747 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:18,748 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:18,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 12 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 682 treesize of output 3062 [2023-02-17 20:10:19,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,321 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,377 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:19,438 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,441 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,492 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:19,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,560 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:19,637 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 20:10:19,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:19,674 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:19,738 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:19,744 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:19,758 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:19,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:19,771 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:19,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,809 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:10:19,824 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,826 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,828 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,831 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,866 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,867 INFO L217 Elim1Store]: Index analysis took 132 ms [2023-02-17 20:10:19,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 20:10:19,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 42 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 37 new quantified variables, introduced 0 case distinctions, treesize of input 6900 treesize of output 76461 [2023-02-17 20:20:10,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 20:20:10,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214448153] [2023-02-17 20:20:10,244 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 20:20:10,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352247033] [2023-02-17 20:20:10,244 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-17 20:20:10,249 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-02-17 20:20:10,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 20:20:10,446 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Probably an infinite loop! at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:323) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-02-17 20:20:10,450 INFO L158 Benchmark]: Toolchain (without parser) took 600722.61ms. Allocated memory was 165.7MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 119.7MB in the beginning and 511.4MB in the end (delta: -391.7MB). Peak memory consumption was 766.9MB. Max. memory is 16.1GB. [2023-02-17 20:20:10,450 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 132.1MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 20:20:10,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.26ms. Allocated memory is still 165.7MB. Free memory was 119.0MB in the beginning and 108.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 20:20:10,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.67ms. Allocated memory is still 165.7MB. Free memory was 108.6MB in the beginning and 107.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 20:20:10,451 INFO L158 Benchmark]: Boogie Preprocessor took 34.14ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 105.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 20:20:10,451 INFO L158 Benchmark]: RCFGBuilder took 350.80ms. Allocated memory is still 165.7MB. Free memory was 105.7MB in the beginning and 93.9MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 20:20:10,451 INFO L158 Benchmark]: TraceAbstraction took 600016.71ms. Allocated memory was 165.7MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 93.7MB in the beginning and 511.4MB in the end (delta: -417.6MB). Peak memory consumption was 741.7MB. Max. memory is 16.1GB. [2023-02-17 20:20:10,452 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 132.1MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.26ms. Allocated memory is still 165.7MB. Free memory was 119.0MB in the beginning and 108.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.67ms. Allocated memory is still 165.7MB. Free memory was 108.6MB in the beginning and 107.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.14ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 105.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 350.80ms. Allocated memory is still 165.7MB. Free memory was 105.7MB in the beginning and 93.9MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 600016.71ms. Allocated memory was 165.7MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 93.7MB in the beginning and 511.4MB in the end (delta: -417.6MB). Peak memory consumption was 741.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Probably an infinite loop! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Probably an infinite loop!: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:124) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-17 20:20:10,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array11_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 20:20:12,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 20:20:12,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 20:20:12,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 20:20:12,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 20:20:12,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 20:20:12,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 20:20:12,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 20:20:12,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 20:20:12,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 20:20:12,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 20:20:12,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 20:20:12,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 20:20:12,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 20:20:12,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 20:20:12,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 20:20:12,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 20:20:12,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 20:20:12,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 20:20:12,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 20:20:12,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 20:20:12,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 20:20:12,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 20:20:12,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 20:20:12,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 20:20:12,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 20:20:12,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 20:20:12,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 20:20:12,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 20:20:12,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 20:20:12,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 20:20:12,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 20:20:12,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 20:20:12,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 20:20:12,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 20:20:12,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 20:20:12,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 20:20:12,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 20:20:12,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 20:20:12,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 20:20:12,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 20:20:12,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-17 20:20:12,654 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 20:20:12,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 20:20:12,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 20:20:12,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 20:20:12,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 20:20:12,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 20:20:12,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 20:20:12,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 20:20:12,657 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 20:20:12,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 20:20:12,657 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 20:20:12,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 20:20:12,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 20:20:12,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 20:20:12,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 20:20:12,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 20:20:12,659 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 20:20:12,659 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 20:20:12,659 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 20:20:12,659 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 20:20:12,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 20:20:12,660 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 20:20:12,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 20:20:12,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 20:20:12,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 20:20:12,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 20:20:12,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 20:20:12,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 20:20:12,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 20:20:12,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 20:20:12,662 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 20:20:12,662 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 20:20:12,662 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 20:20:12,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 20:20:12,662 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 20:20:12,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 20:20:12,663 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 20:20:12,663 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 20:20:12,664 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb [2023-02-17 20:20:12,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 20:20:12,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 20:20:12,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 20:20:12,993 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 20:20:12,994 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 20:20:12,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array11_pattern.c [2023-02-17 20:20:14,219 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 20:20:14,420 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 20:20:14,420 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array11_pattern.c [2023-02-17 20:20:14,426 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbce357d/f257c80bffde470fa26c4f7c9d081288/FLAGca4bf4e98 [2023-02-17 20:20:14,447 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbce357d/f257c80bffde470fa26c4f7c9d081288 [2023-02-17 20:20:14,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 20:20:14,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 20:20:14,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 20:20:14,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 20:20:14,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 20:20:14,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55175e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14, skipping insertion in model container [2023-02-17 20:20:14,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 20:20:14,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 20:20:14,639 WARN L237 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-patterns/array11_pattern.c[1357,1370] [2023-02-17 20:20:14,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 20:20:14,678 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 20:20:14,699 WARN L237 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-patterns/array11_pattern.c[1357,1370] [2023-02-17 20:20:14,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 20:20:14,741 INFO L208 MainTranslator]: Completed translation [2023-02-17 20:20:14,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14 WrapperNode [2023-02-17 20:20:14,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 20:20:14,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 20:20:14,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 20:20:14,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 20:20:14,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,780 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2023-02-17 20:20:14,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 20:20:14,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 20:20:14,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 20:20:14,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 20:20:14,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,804 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 20:20:14,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 20:20:14,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 20:20:14,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 20:20:14,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (1/1) ... [2023-02-17 20:20:14,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 20:20:14,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 20:20:14,838 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-02-17 20:20:14,844 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-02-17 20:20:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 20:20:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 20:20:14,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 20:20:14,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 20:20:14,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 20:20:14,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-17 20:20:14,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 20:20:14,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 20:20:14,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 20:20:14,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-17 20:20:14,928 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 20:20:14,930 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 20:20:15,141 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 20:20:15,145 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 20:20:15,146 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-17 20:20:15,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:20:15 BoogieIcfgContainer [2023-02-17 20:20:15,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 20:20:15,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 20:20:15,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 20:20:15,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 20:20:15,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:20:14" (1/3) ... [2023-02-17 20:20:15,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6a28a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:20:15, skipping insertion in model container [2023-02-17 20:20:15,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:20:14" (2/3) ... [2023-02-17 20:20:15,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6a28a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:20:15, skipping insertion in model container [2023-02-17 20:20:15,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:20:15" (3/3) ... [2023-02-17 20:20:15,155 INFO L112 eAbstractionObserver]: Analyzing ICFG array11_pattern.c [2023-02-17 20:20:15,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 20:20:15,170 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 20:20:15,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 20:20:15,250 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ed361df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 20:20:15,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 20:20:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:20:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 20:20:15,260 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 20:20:15,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 20:20:15,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 20:20:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 20:20:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash -800294020, now seen corresponding path program 1 times [2023-02-17 20:20:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 20:20:15,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662661199] [2023-02-17 20:20:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:20:15,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 20:20:15,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 20:20:15,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 20:20:15,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 20:20:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 20:20:15,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 20:20:15,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 20:20:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 20:20:15,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 20:20:15,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 20:20:15,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662661199] [2023-02-17 20:20:15,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662661199] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 20:20:15,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 20:20:15,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 20:20:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705963346] [2023-02-17 20:20:15,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 20:20:15,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 20:20:15,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 20:20:15,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 20:20:15,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 20:20:15,565 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 20:20:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 20:20:15,587 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2023-02-17 20:20:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 20:20:15,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-17 20:20:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 20:20:15,596 INFO L225 Difference]: With dead ends: 47 [2023-02-17 20:20:15,596 INFO L226 Difference]: Without dead ends: 21 [2023-02-17 20:20:15,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 20:20:15,604 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 20:20:15,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 20:20:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-17 20:20:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-17 20:20:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:20:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-02-17 20:20:15,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2023-02-17 20:20:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 20:20:15,641 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-02-17 20:20:15,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 20:20:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-02-17 20:20:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 20:20:15,644 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 20:20:15,644 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 20:20:15,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-17 20:20:15,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 20:20:15,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 20:20:15,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 20:20:15,855 INFO L85 PathProgramCache]: Analyzing trace with hash -952637313, now seen corresponding path program 1 times [2023-02-17 20:20:15,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 20:20:15,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085419059] [2023-02-17 20:20:15,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:20:15,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 20:20:15,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 20:20:15,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 20:20:15,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 20:20:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 20:20:16,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 20:20:16,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 20:20:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 20:20:16,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 20:20:16,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 20:20:16,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085419059] [2023-02-17 20:20:16,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085419059] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 20:20:16,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 20:20:16,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 20:20:16,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452372073] [2023-02-17 20:20:16,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 20:20:16,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 20:20:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 20:20:16,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 20:20:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 20:20:16,098 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:20:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 20:20:16,147 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-02-17 20:20:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 20:20:16,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-02-17 20:20:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 20:20:16,150 INFO L225 Difference]: With dead ends: 26 [2023-02-17 20:20:16,150 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 20:20:16,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 20:20:16,156 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 20:20:16,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 20:20:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 20:20:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-17 20:20:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:20:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-02-17 20:20:16,162 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 22 [2023-02-17 20:20:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 20:20:16,163 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-02-17 20:20:16,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:20:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-02-17 20:20:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 20:20:16,164 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 20:20:16,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 20:20:16,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 20:20:16,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 20:20:16,365 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 20:20:16,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 20:20:16,366 INFO L85 PathProgramCache]: Analyzing trace with hash -603190335, now seen corresponding path program 1 times [2023-02-17 20:20:16,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 20:20:16,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068163666] [2023-02-17 20:20:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:20:16,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 20:20:16,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 20:20:16,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 20:20:16,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 20:20:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 20:20:16,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 20:20:16,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 20:20:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 20:20:16,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 20:20:16,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 20:20:16,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068163666] [2023-02-17 20:20:16,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068163666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 20:20:16,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 20:20:16,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 20:20:16,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741608637] [2023-02-17 20:20:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 20:20:16,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 20:20:16,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 20:20:16,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 20:20:16,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-02-17 20:20:16,622 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:20:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 20:20:16,925 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2023-02-17 20:20:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 20:20:16,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-17 20:20:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 20:20:16,926 INFO L225 Difference]: With dead ends: 45 [2023-02-17 20:20:16,926 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 20:20:16,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-02-17 20:20:16,928 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 20:20:16,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 35 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 20:20:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 20:20:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-02-17 20:20:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:20:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-02-17 20:20:16,935 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2023-02-17 20:20:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 20:20:16,936 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-02-17 20:20:16,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 20:20:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-02-17 20:20:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 20:20:16,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 20:20:16,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 20:20:16,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-02-17 20:20:17,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 20:20:17,150 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 20:20:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 20:20:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1366149955, now seen corresponding path program 1 times [2023-02-17 20:20:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 20:20:17,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573923966] [2023-02-17 20:20:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 20:20:17,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 20:20:17,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 20:20:17,153 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 20:20:17,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 20:20:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 20:20:17,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 20:20:17,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 20:20:17,343 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-02-17 20:20:17,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 20:20:17,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2023-02-17 20:20:17,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 46 [2023-02-17 20:20:17,838 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 0 case distinctions, treesize of input 14 treesize of output 13 [2023-02-17 20:20:17,967 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 0 case distinctions, treesize of input 28 treesize of output 27 [2023-02-17 20:20:20,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 20:20:20,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 204 [2023-02-17 20:20:22,793 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_9| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_9|) c_~ARR_SIZE~0)) (let ((.cse4 (bvadd (_ bv18446744073709551615 64) c_~ARR_SIZE~0)) (.cse1 (bvadd (bvmul (_ bv4 32) (_ bv0 32)) (_ bv0 32)))) (let ((.cse32 (exists ((v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) v_arrayElimCell_7)) |c_ULTIMATE.start_main_~sum~0#1| (bvmul ((_ sign_extend 32) v_arrayElimCell_11) (_ bv18446744073709551615 64)))))) (.cse31 (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16)) (v_prenex_1 (_ BitVec 16))) (let ((.cse107 ((_ sign_extend 48) v_prenex_1))) (let ((.cse108 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse107)) (_ bv0 32))) (.cse106 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32)))) (and (not (= .cse106 .cse1)) (bvsge .cse107 (_ bv0 64)) (not (= .cse4 .cse107)) (not (= .cse108 .cse1)) (bvslt .cse107 c_~ARR_SIZE~0) (not (= .cse108 .cse106))))))) (.cse33 (exists ((v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) v_arrayElimCell_7)) (bvmul ((_ sign_extend 32) v_arrayElimCell_6) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|)))) (.cse62 (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16)) (v_prenex_1 (_ BitVec 16))) (let ((.cse104 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse105 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32))) (.cse103 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse104)) (_ bv0 32)))) (and (not (= .cse103 .cse1)) (= .cse104 .cse4) (bvsge .cse104 (_ bv0 64)) (not (= .cse105 .cse1)) (not (= .cse105 .cse103)) (bvslt .cse104 c_~ARR_SIZE~0)))))) (.cse73 (exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) v_arrayElimCell_7)) (bvmul ((_ sign_extend 32) v_arrayElimCell_8) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))) (or (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse0 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32)))) (and (not (= .cse0 .cse1)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse3 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse5 ((_ extract 31 0) .cse3))) (let ((.cse2 (bvadd (bvmul (_ bv4 32) .cse5) (_ bv0 32)))) (and (not (= .cse2 .cse1)) (= .cse3 .cse4) (= (_ bv0 64) (bvadd (bvmul ((_ sign_extend 32) .cse5) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) v_arrayElimCell_6) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|)) (bvsge .cse3 (_ bv0 64)) (not (= .cse0 .cse2)) (bvslt .cse3 c_~ARR_SIZE~0))))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse9 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse6 ((_ extract 31 0) .cse9))) (let ((.cse7 (bvadd (bvmul (_ bv4 32) .cse6) (_ bv0 32)))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul ((_ sign_extend 32) .cse6) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) v_arrayElimCell_6) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))) (not (= .cse7 .cse1)) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse8 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32)))) (and (not (= .cse8 .cse1)) (not (= .cse8 .cse7))))) (= .cse9 .cse4) (bvsge .cse9 (_ bv0 64)) (bvslt .cse9 c_~ARR_SIZE~0)))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse11 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse13 ((_ extract 31 0) .cse11))) (let ((.cse10 (bvadd (bvmul (_ bv4 32) .cse13) (_ bv0 32)))) (and (not (= .cse10 .cse1)) (= .cse11 .cse4) (bvsge .cse11 (_ bv0 64)) (bvslt .cse11 c_~ARR_SIZE~0) (exists ((v_prenex_1 (_ BitVec 16))) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32)) .cse10))) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse12 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse12 (bvmul .cse12 (bvmul .cse12 (bvmul .cse11 .cse12)))))))) (bvmul ((_ sign_extend 32) .cse13) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|)))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse15 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse14 ((_ extract 31 0) .cse15))) (and (not (= (bvadd (bvmul (_ bv4 32) .cse14) (_ bv0 32)) .cse1)) (= .cse15 .cse4) (bvsge .cse15 (_ bv0 64)) (bvslt .cse15 c_~ARR_SIZE~0) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse16 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse16 (bvmul .cse16 (bvmul .cse16 (bvmul .cse15 .cse16)))))))) (bvmul ((_ sign_extend 32) .cse14) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|)))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse20 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32)))) (and (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse19 ((_ sign_extend 48) v_prenex_1))) (and (exists ((v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (let ((.cse18 ((_ sign_extend 32) v_prenex_2))) (let ((.cse17 (bvmul .cse19 .cse18))) (bvadd (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse17 .cse18) .cse18) .cse18))) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse17)) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))) (bvsge .cse19 (_ bv0 64)) (not (= .cse4 .cse19)) (bvslt .cse19 c_~ARR_SIZE~0) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse19)) (_ bv0 32)) .cse20))))) (not (= .cse20 .cse1))))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse21 ((_ sign_extend 48) v_prenex_1))) (and (exists ((v_arrayElimCell_7 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) v_arrayElimCell_7)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse22 ((_ sign_extend 32) v_prenex_2))) (bvmul (bvmul (bvmul (bvmul .cse21 .cse22) .cse22) .cse22) .cse22)))) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))) (bvsge .cse21 (_ bv0 64)) (not (= .cse4 .cse21)) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse21)) (_ bv0 32)) .cse1)) (bvslt .cse21 c_~ARR_SIZE~0)))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse24 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse23 ((_ extract 31 0) .cse24))) (and (not (= (bvadd (bvmul (_ bv4 32) .cse23) (_ bv0 32)) .cse1)) (= .cse24 .cse4) (= (_ bv0 64) (bvadd (bvmul ((_ sign_extend 32) .cse23) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) v_arrayElimCell_6) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|)) (bvsge .cse24 (_ bv0 64)) (bvslt .cse24 c_~ARR_SIZE~0))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (let ((.cse25 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (and (= .cse25 .cse4) (bvsge .cse25 (_ bv0 64)) (bvslt .cse25 c_~ARR_SIZE~0) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse26 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse26 (bvmul .cse26 (bvmul .cse26 (bvmul .cse25 .cse26)))))))) (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse25)) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse29 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse27 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse29)) (_ bv0 32)))) (and (not (= .cse27 .cse1)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse28 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse28 (bvmul .cse28 (bvmul .cse28 (bvmul .cse29 .cse28)))))))) (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) v_arrayElimCell_7)) |c_ULTIMATE.start_main_~sum~0#1|))) (= .cse29 .cse4) (bvsge .cse29 (_ bv0 64)) (bvslt .cse29 c_~ARR_SIZE~0) (exists ((v_prenex_1 (_ BitVec 16))) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32)) .cse27))))))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse30 ((_ sign_extend 48) v_prenex_1))) (and (bvsge .cse30 (_ bv0 64)) (not (= .cse4 .cse30)) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse30)) (_ bv0 32)) .cse1)) (bvslt .cse30 c_~ARR_SIZE~0) (exists ((v_arrayElimCell_6 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse30 ((_ sign_extend 32) v_prenex_2)))) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) v_arrayElimCell_6) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|)))))) (and .cse31 .cse32) (and .cse33 (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse34 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (and (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse34)) (_ bv0 32)) .cse1)) (= .cse34 .cse4) (bvsge .cse34 (_ bv0 64)) (bvslt .cse34 c_~ARR_SIZE~0))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse35 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32)))) (and (not (= .cse35 .cse1)) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse36 ((_ sign_extend 48) v_prenex_1))) (let ((.cse37 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse36)) (_ bv0 32)))) (and (bvsge .cse36 (_ bv0 64)) (not (= .cse4 .cse36)) (not (= .cse37 .cse1)) (bvslt .cse36 c_~ARR_SIZE~0) (exists ((v_arrayElimCell_6 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse36 ((_ sign_extend 32) v_prenex_2)))) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) v_arrayElimCell_6) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))) (not (= .cse37 .cse35))))))))) (and (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse38 ((_ sign_extend 48) v_prenex_1))) (and (bvsge .cse38 (_ bv0 64)) (not (= .cse4 .cse38)) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse38)) (_ bv0 32)) .cse1)) (bvslt .cse38 c_~ARR_SIZE~0)))) .cse33) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse39 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32)))) (and (not (= .cse39 .cse1)) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse40 ((_ sign_extend 48) v_prenex_1))) (let ((.cse42 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse40)) (_ bv0 32)))) (and (exists ((v_arrayElimCell_7 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) v_arrayElimCell_7)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse41 ((_ sign_extend 32) v_prenex_2))) (bvmul (bvmul (bvmul (bvmul .cse40 .cse41) .cse41) .cse41) .cse41)))) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))) (bvsge .cse40 (_ bv0 64)) (not (= .cse4 .cse40)) (not (= .cse42 .cse1)) (bvslt .cse40 c_~ARR_SIZE~0) (not (= .cse42 .cse39))))))))) (and .cse32 (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16)) (v_prenex_1 (_ BitVec 16))) (let ((.cse43 ((_ sign_extend 48) v_prenex_1))) (let ((.cse44 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse43)) (_ bv0 32)))) (and (bvsge .cse43 (_ bv0 64)) (not (= .cse4 .cse43)) (not (= .cse44 .cse1)) (bvslt .cse43 c_~ARR_SIZE~0) (not (= .cse44 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32))))))))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse48 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse47 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse45 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse47)) (_ bv0 32)))) (and (not (= .cse45 .cse1)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse46 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse46 (bvmul .cse46 (bvmul .cse46 (bvmul .cse47 .cse46)))))))) (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) v_arrayElimCell_7)) |c_ULTIMATE.start_main_~sum~0#1|))) (= .cse47 .cse4) (bvsge .cse47 (_ bv0 64)) (not (= .cse48 .cse45)) (bvslt .cse47 c_~ARR_SIZE~0))))) (not (= .cse48 .cse1))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16)) (|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse50 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (and (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse49 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse49 (bvmul .cse49 (bvmul .cse49 (bvmul .cse50 .cse49)))))))) (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) v_arrayElimCell_7)) |c_ULTIMATE.start_main_~sum~0#1|)) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse50)) (_ bv0 32)) .cse1)) (= .cse50 .cse4) (bvsge .cse50 (_ bv0 64)) (bvslt .cse50 c_~ARR_SIZE~0)))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse51 ((_ sign_extend 48) v_prenex_1))) (let ((.cse53 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse51)) (_ bv0 32)))) (and (exists ((v_arrayElimCell_7 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) v_arrayElimCell_7)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse52 ((_ sign_extend 32) v_prenex_2))) (bvmul (bvmul (bvmul (bvmul .cse51 .cse52) .cse52) .cse52) .cse52)))) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))) (bvsge .cse51 (_ bv0 64)) (not (= .cse4 .cse51)) (not (= .cse53 .cse1)) (bvslt .cse51 c_~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse54 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32)))) (and (not (= .cse54 .cse1)) (not (= .cse53 .cse54))))))))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse55 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32)))) (and (not (= .cse55 .cse1)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse57 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse58 ((_ extract 31 0) .cse57))) (let ((.cse56 (bvadd (bvmul (_ bv4 32) .cse58) (_ bv0 32)))) (and (not (= .cse56 .cse1)) (= .cse57 .cse4) (bvsge .cse57 (_ bv0 64)) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul ((_ sign_extend 32) v_arrayElimCell_8) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) .cse58) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))) (not (= .cse55 .cse56)) (bvslt .cse57 c_~ARR_SIZE~0))))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse60 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse59 ((_ extract 31 0) .cse60))) (and (not (= (bvadd (bvmul (_ bv4 32) .cse59) (_ bv0 32)) .cse1)) (= .cse60 .cse4) (bvsge .cse60 (_ bv0 64)) (bvslt .cse60 c_~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse61 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse61 (bvmul .cse61 (bvmul .cse61 (bvmul .cse60 .cse61)))))))) (bvmul ((_ sign_extend 32) .cse59) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))))) (and .cse62 .cse33) (and .cse31 .cse33) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse63 ((_ sign_extend 48) v_prenex_1))) (let ((.cse65 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse63)) (_ bv0 32)))) (and (exists ((v_arrayElimCell_7 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) v_arrayElimCell_7)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse64 ((_ sign_extend 32) v_prenex_2))) (bvmul (bvmul (bvmul (bvmul .cse63 .cse64) .cse64) .cse64) .cse64)))) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))) (bvsge .cse63 (_ bv0 64)) (not (= .cse4 .cse63)) (not (= .cse65 .cse1)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (not (= .cse65 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32))))) (bvslt .cse63 c_~ARR_SIZE~0))))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse68 ((_ sign_extend 48) v_prenex_1))) (and (exists ((v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (let ((.cse67 ((_ sign_extend 32) v_prenex_2))) (let ((.cse66 (bvmul .cse68 .cse67))) (bvadd (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse66 .cse67) .cse67) .cse67))) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse66)) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))) (bvsge .cse68 (_ bv0 64)) (not (= .cse4 .cse68)) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse68)) (_ bv0 32)) .cse1)) (bvslt .cse68 c_~ARR_SIZE~0)))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse69 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (and (= .cse69 .cse4) (bvsge .cse69 (_ bv0 64)) (bvslt .cse69 c_~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse70 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse70 (bvmul .cse70 (bvmul .cse70 (bvmul .cse69 .cse70)))))))) (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse69)) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|)))))) (and (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16)) (v_prenex_1 (_ BitVec 16))) (let ((.cse72 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse71 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse72)) (_ bv0 32)))) (and (not (= .cse71 .cse1)) (= .cse72 .cse4) (bvsge .cse72 (_ bv0 64)) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32)) .cse71)) (bvslt .cse72 c_~ARR_SIZE~0))))) .cse73) (and .cse62 .cse73) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse76 ((_ sign_extend 48) v_prenex_1))) (let ((.cse77 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse76)) (_ bv0 32)))) (and (exists ((v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (let ((.cse75 ((_ sign_extend 32) v_prenex_2))) (let ((.cse74 (bvmul .cse76 .cse75))) (bvadd (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse74 .cse75) .cse75) .cse75))) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse74)) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))) (bvsge .cse76 (_ bv0 64)) (not (= .cse4 .cse76)) (not (= .cse77 .cse1)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (not (= .cse77 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32))))) (bvslt .cse76 c_~ARR_SIZE~0))))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse78 ((_ sign_extend 48) v_prenex_1))) (let ((.cse79 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse78)) (_ bv0 32)))) (and (exists ((v_arrayElimCell_11 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul .cse78 ((_ sign_extend 32) v_prenex_2)))) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1| (bvmul ((_ sign_extend 32) v_arrayElimCell_11) (_ bv18446744073709551615 64))))) (bvsge .cse78 (_ bv0 64)) (not (= .cse4 .cse78)) (not (= .cse79 .cse1)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (not (= .cse79 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32))))) (bvslt .cse78 c_~ARR_SIZE~0))))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse82 ((_ sign_extend 48) v_prenex_1))) (and (exists ((v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (let ((.cse81 ((_ sign_extend 32) v_prenex_2))) (let ((.cse80 (bvmul .cse82 .cse81))) (bvadd (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse80 .cse81) .cse81) .cse81))) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse80)) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))) (bvsge .cse82 (_ bv0 64)) (not (= .cse4 .cse82)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse82)) (_ bv0 32)) (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32))))) (bvslt .cse82 c_~ARR_SIZE~0)))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse87 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (_ bv0 32)))) (and (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse85 ((_ sign_extend 48) v_prenex_1))) (let ((.cse86 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) .cse85)) (_ bv0 32)))) (and (exists ((v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (let ((.cse84 ((_ sign_extend 32) v_prenex_2))) (let ((.cse83 (bvmul .cse85 .cse84))) (bvadd (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse83 .cse84) .cse84) .cse84))) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse83)) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))) (bvsge .cse85 (_ bv0 64)) (not (= .cse4 .cse85)) (not (= .cse86 .cse1)) (bvslt .cse85 c_~ARR_SIZE~0) (not (= .cse86 .cse87)))))) (not (= .cse87 .cse1))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse88 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse89 ((_ extract 31 0) .cse88))) (and (= .cse88 .cse4) (bvsge .cse88 (_ bv0 64)) (bvslt .cse88 c_~ARR_SIZE~0) (exists ((v_prenex_1 (_ BitVec 16))) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32)) (bvadd (bvmul (_ bv4 32) .cse89) (_ bv0 32))))) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse90 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse90 (bvmul .cse90 (bvmul .cse90 (bvmul .cse88 .cse90)))))))) (bvmul ((_ sign_extend 32) .cse89) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse92 (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse91 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse93 ((_ extract 31 0) .cse91))) (and (= .cse91 .cse4) (bvsge .cse91 (_ bv0 64)) (not (= .cse92 (bvadd (bvmul (_ bv4 32) .cse93) (_ bv0 32)))) (bvslt .cse91 c_~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul (_ bv18446744073709551615 64) ((_ sign_extend 32) ((_ extract 31 0) (let ((.cse94 ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))) (bvmul .cse94 (bvmul .cse94 (bvmul .cse94 (bvmul .cse91 .cse94)))))))) (bvmul ((_ sign_extend 32) .cse93) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))))) (not (= .cse92 .cse1))))) (exists ((v_prenex_1 (_ BitVec 16))) (let ((.cse97 ((_ sign_extend 48) v_prenex_1))) (and (exists ((v_prenex_2 (_ BitVec 32))) (= (_ bv0 64) (let ((.cse96 ((_ sign_extend 32) v_prenex_2))) (let ((.cse95 (bvmul .cse97 .cse96))) (bvadd (bvmul ((_ sign_extend 32) ((_ extract 31 0) (bvmul (bvmul (bvmul .cse95 .cse96) .cse96) .cse96))) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) ((_ extract 31 0) .cse95)) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))))) (bvsge .cse97 (_ bv0 64)) (not (= .cse4 .cse97)) (bvslt .cse97 c_~ARR_SIZE~0)))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse99 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse98 ((_ extract 31 0) .cse99))) (and (exists ((v_arrayElimCell_6 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul ((_ sign_extend 32) .cse98) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) v_arrayElimCell_6) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))) (not (= (bvadd (bvmul (_ bv4 32) .cse98) (_ bv0 32)) .cse1)) (= .cse99 .cse4) (bvsge .cse99 (_ bv0 64)) (bvslt .cse99 c_~ARR_SIZE~0))))) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_4| (_ BitVec 16))) (let ((.cse101 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_4|))) (let ((.cse102 ((_ extract 31 0) .cse101))) (let ((.cse100 (bvadd (bvmul (_ bv4 32) .cse102) (_ bv0 32)))) (and (not (= .cse100 .cse1)) (= .cse101 .cse4) (bvsge .cse101 (_ bv0 64)) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= (_ bv0 64) (bvadd (bvmul ((_ sign_extend 32) v_arrayElimCell_8) (_ bv18446744073709551615 64)) (bvmul ((_ sign_extend 32) .cse102) (_ bv18446744073709551615 64)) |c_ULTIMATE.start_main_~sum~0#1|))) (bvslt .cse101 c_~ARR_SIZE~0) (exists ((v_prenex_1 (_ BitVec 16))) (not (= (bvadd (bvmul (_ bv4 32) ((_ extract 31 0) ((_ sign_extend 48) v_prenex_1))) (_ bv0 32)) .cse100))))))))))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) c_~ARR_SIZE~0)) (bvsgt c_~ARR_SIZE~0 (_ bv0 64))) is different from false [2023-02-17 20:20:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-17 20:20:33,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 20:20:35,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 20:20:35,683 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 307 treesize of output 272 [2023-02-17 20:20:36,154 INFO L217 Elim1Store]: Index analysis took 126 ms [2023-02-17 20:20:36,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 20:20:36,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 211 [2023-02-17 20:20:36,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 20:20:36,339 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 562 treesize of output 552 [2023-02-17 20:20:36,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 20:20:36,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 702 treesize of output 608