./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array7_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/array7_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 85b55cdd1f26353e63ecc189ba28ba899672edc569fe3ef3f04470f2b5e667fa --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 09:49:41,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 09:49:41,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 09:49:41,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 09:49:41,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 09:49:41,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 09:49:41,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 09:49:41,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 09:49:41,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 09:49:41,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 09:49:41,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 09:49:41,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 09:49:41,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 09:49:41,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 09:49:41,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 09:49:41,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 09:49:41,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 09:49:41,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 09:49:41,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 09:49:41,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 09:49:41,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 09:49:41,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 09:49:41,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 09:49:41,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 09:49:41,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 09:49:41,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 09:49:41,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 09:49:41,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 09:49:41,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 09:49:41,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 09:49:41,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 09:49:41,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 09:49:41,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 09:49:41,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 09:49:41,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 09:49:41,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 09:49:41,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 09:49:41,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 09:49:41,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 09:49:41,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 09:49:41,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 09:49:41,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 09:49:41,785 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 09:49:41,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 09:49:41,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 09:49:41,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 09:49:41,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 09:49:41,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 09:49:41,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 09:49:41,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 09:49:41,788 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 09:49:41,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 09:49:41,788 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 09:49:41,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 09:49:41,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 09:49:41,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 09:49:41,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 09:49:41,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 09:49:41,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 09:49:41,789 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 09:49:41,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 09:49:41,790 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 09:49:41,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 09:49:41,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 09:49:41,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 09:49:41,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 09:49:41,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 09:49:41,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 09:49:41,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 09:49:41,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 09:49:41,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 09:49:41,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 09:49:41,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 09:49:41,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 09:49:41,792 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 09:49:41,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 09:49:41,792 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 09:49:41,793 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 -> 85b55cdd1f26353e63ecc189ba28ba899672edc569fe3ef3f04470f2b5e667fa [2023-02-15 09:49:42,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 09:49:42,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 09:49:42,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 09:49:42,115 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 09:49:42,115 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 09:49:42,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array7_pattern.c [2023-02-15 09:49:43,209 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 09:49:43,373 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 09:49:43,374 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array7_pattern.c [2023-02-15 09:49:43,379 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6638bf1e/32dd579bf936485298fb961576c13d64/FLAGab2c4df06 [2023-02-15 09:49:43,402 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6638bf1e/32dd579bf936485298fb961576c13d64 [2023-02-15 09:49:43,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 09:49:43,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 09:49:43,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 09:49:43,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 09:49:43,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 09:49:43,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333d380c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43, skipping insertion in model container [2023-02-15 09:49:43,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 09:49:43,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 09:49:43,590 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/array7_pattern.c[1375,1388] [2023-02-15 09:49:43,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 09:49:43,629 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 09:49:43,642 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/array7_pattern.c[1375,1388] [2023-02-15 09:49:43,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 09:49:43,684 INFO L208 MainTranslator]: Completed translation [2023-02-15 09:49:43,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43 WrapperNode [2023-02-15 09:49:43,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 09:49:43,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 09:49:43,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 09:49:43,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 09:49:43,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,731 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2023-02-15 09:49:43,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 09:49:43,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 09:49:43,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 09:49:43,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 09:49:43,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,771 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 09:49:43,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 09:49:43,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 09:49:43,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 09:49:43,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (1/1) ... [2023-02-15 09:49:43,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 09:49:43,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:49:43,811 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-15 09:49:43,832 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-15 09:49:43,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 09:49:43,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 09:49:43,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 09:49:43,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 09:49:43,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 09:49:43,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 09:49:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 09:49:43,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 09:49:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 09:49:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 09:49:43,932 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 09:49:43,935 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 09:49:44,148 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 09:49:44,153 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 09:49:44,153 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 09:49:44,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:49:44 BoogieIcfgContainer [2023-02-15 09:49:44,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 09:49:44,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 09:49:44,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 09:49:44,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 09:49:44,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:49:43" (1/3) ... [2023-02-15 09:49:44,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36379ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:49:44, skipping insertion in model container [2023-02-15 09:49:44,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:49:43" (2/3) ... [2023-02-15 09:49:44,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36379ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:49:44, skipping insertion in model container [2023-02-15 09:49:44,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:49:44" (3/3) ... [2023-02-15 09:49:44,162 INFO L112 eAbstractionObserver]: Analyzing ICFG array7_pattern.c [2023-02-15 09:49:44,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 09:49:44,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 09:49:44,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 09:49:44,264 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;@4c314be3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 09:49:44,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 09:49:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:49:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 09:49:44,273 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:49:44,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:49:44,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:49:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:49:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash -440982883, now seen corresponding path program 1 times [2023-02-15 09:49:44,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:49:44,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202215102] [2023-02-15 09:49:44,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:49:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:49:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 09:49:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:44,411 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-15 09:49:44,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:49:44,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202215102] [2023-02-15 09:49:44,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202215102] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 09:49:44,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 09:49:44,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 09:49:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669197840] [2023-02-15 09:49:44,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 09:49:44,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 09:49:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:49:44,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 09:49:44,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 09:49:44,447 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-15 09:49:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:49:44,462 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2023-02-15 09:49:44,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 09:49:44,464 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-15 09:49:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:49:44,469 INFO L225 Difference]: With dead ends: 49 [2023-02-15 09:49:44,469 INFO L226 Difference]: Without dead ends: 22 [2023-02-15 09:49:44,471 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-15 09:49:44,475 INFO L413 NwaCegarLoop]: 30 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, 30 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-15 09:49:44,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 09:49:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-15 09:49:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-15 09:49:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:49:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-02-15 09:49:44,505 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2023-02-15 09:49:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:49:44,506 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-02-15 09:49:44,506 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-15 09:49:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-02-15 09:49:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 09:49:44,508 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:49:44,508 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:49:44,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 09:49:44,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:49:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:49:44,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1396045698, now seen corresponding path program 1 times [2023-02-15 09:49:44,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:49:44,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803245922] [2023-02-15 09:49:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:49:44,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:49:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 09:49:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:44,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 09:49:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:44,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 09:49:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 09:49:44,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:49:44,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803245922] [2023-02-15 09:49:44,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803245922] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 09:49:44,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 09:49:44,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 09:49:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952694549] [2023-02-15 09:49:44,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 09:49:44,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 09:49:44,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:49:44,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 09:49:44,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 09:49:44,869 INFO L87 Difference]: Start difference. First operand 22 states and 26 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 09:49:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:49:44,893 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-02-15 09:49:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 09:49:44,894 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-02-15 09:49:44,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:49:44,895 INFO L225 Difference]: With dead ends: 27 [2023-02-15 09:49:44,895 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 09:49:44,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-15 09:49:44,897 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 59 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-15 09:49:44,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 09:49:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 09:49:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 09:49:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:49:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 09:49:44,903 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 27 [2023-02-15 09:49:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:49:44,904 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 09:49:44,905 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 09:49:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 09:49:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 09:49:44,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:49:44,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:49:44,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 09:49:44,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:49:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:49:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1623352868, now seen corresponding path program 1 times [2023-02-15 09:49:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:49:44,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821920135] [2023-02-15 09:49:44,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:49:44,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:49:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:45,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 09:49:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:45,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 09:49:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:45,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 09:49:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 09:49:45,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:49:45,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821920135] [2023-02-15 09:49:45,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821920135] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 09:49:45,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 09:49:45,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 09:49:45,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258349741] [2023-02-15 09:49:45,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 09:49:45,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 09:49:45,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:49:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 09:49:45,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 09:49:45,123 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 09:49:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:49:45,163 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-02-15 09:49:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 09:49:45,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-02-15 09:49:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:49:45,165 INFO L225 Difference]: With dead ends: 43 [2023-02-15 09:49:45,165 INFO L226 Difference]: Without dead ends: 26 [2023-02-15 09:49:45,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-15 09:49:45,167 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 09:49:45,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 09:49:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-15 09:49:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-02-15 09:49:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:49:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-02-15 09:49:45,173 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2023-02-15 09:49:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:49:45,174 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-02-15 09:49:45,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 09:49:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-02-15 09:49:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 09:49:45,175 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:49:45,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:49:45,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 09:49:45,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:49:45,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:49:45,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1083978846, now seen corresponding path program 1 times [2023-02-15 09:49:45,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:49:45,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076458561] [2023-02-15 09:49:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:49:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:49:45,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:49:45,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570916924] [2023-02-15 09:49:45,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:49:45,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:49:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:49:45,218 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-15 09:49:45,221 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-15 09:49:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 09:49:45,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 09:49:45,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:49:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 09:49:45,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 09:49:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 09:49:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:49:45,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076458561] [2023-02-15 09:49:45,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 09:49:45,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570916924] [2023-02-15 09:49:45,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570916924] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 09:49:45,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 09:49:45,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2023-02-15 09:49:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988973037] [2023-02-15 09:49:45,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 09:49:45,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 09:49:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:49:45,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 09:49:45,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-02-15 09:49:45,801 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 09:49:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:49:46,038 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-02-15 09:49:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 09:49:46,039 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 31 [2023-02-15 09:49:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:49:46,040 INFO L225 Difference]: With dead ends: 73 [2023-02-15 09:49:46,040 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 09:49:46,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-02-15 09:49:46,042 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 09:49:46,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 110 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 09:49:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 09:49:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2023-02-15 09:49:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:49:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-15 09:49:46,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 31 [2023-02-15 09:49:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:49:46,074 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-15 09:49:46,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 09:49:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-15 09:49:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 09:49:46,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:49:46,076 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:49:46,085 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-15 09:49:46,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:49:46,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:49:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:49:46,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1214758882, now seen corresponding path program 2 times [2023-02-15 09:49:46,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:49:46,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044445121] [2023-02-15 09:49:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:49:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:49:46,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:49:46,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [152290671] [2023-02-15 09:49:46,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 09:49:46,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:49:46,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:49:46,301 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-15 09:49:46,309 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-15 09:49:46,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 09:49:46,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 09:49:46,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 09:49:46,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:49:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 09:49:46,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 09:49:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 09:49:46,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:49:46,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044445121] [2023-02-15 09:49:46,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 09:49:46,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152290671] [2023-02-15 09:49:46,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152290671] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 09:49:46,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 09:49:46,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-02-15 09:49:46,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495931307] [2023-02-15 09:49:46,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 09:49:46,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 09:49:46,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:49:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 09:49:46,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-15 09:49:46,561 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 09:49:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:49:46,694 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-02-15 09:49:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 09:49:46,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2023-02-15 09:49:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:49:46,699 INFO L225 Difference]: With dead ends: 40 [2023-02-15 09:49:46,699 INFO L226 Difference]: Without dead ends: 36 [2023-02-15 09:49:46,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2023-02-15 09:49:46,702 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 09:49:46,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 68 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 09:49:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-15 09:49:46,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-02-15 09:49:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:49:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2023-02-15 09:49:46,721 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 35 [2023-02-15 09:49:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:49:46,721 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2023-02-15 09:49:46,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 09:49:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2023-02-15 09:49:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 09:49:46,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:49:46,724 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:49:46,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 09:49:46,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:49:46,930 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:49:46,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:49:46,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1618850078, now seen corresponding path program 3 times [2023-02-15 09:49:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:49:46,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359182546] [2023-02-15 09:49:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:49:46,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:49:46,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:49:46,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959815281] [2023-02-15 09:49:46,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 09:49:46,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:49:46,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:49:46,947 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-15 09:49:46,954 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-15 09:49:47,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-15 09:49:47,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 09:49:47,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 82 conjunts are in the unsatisfiable core [2023-02-15 09:49:47,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:49:47,166 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-15 09:49:47,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:47,210 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 32 treesize of output 36 [2023-02-15 09:49:47,218 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 33 treesize of output 33 [2023-02-15 09:49:47,223 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 15 treesize of output 14 [2023-02-15 09:49:47,231 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-15 09:49:47,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:47,311 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 44 [2023-02-15 09:49:47,319 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 38 treesize of output 36 [2023-02-15 09:49:47,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:47,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2023-02-15 09:49:47,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:47,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 09:49:47,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:47,442 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 55 treesize of output 52 [2023-02-15 09:49:47,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:47,477 INFO L321 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-02-15 09:49:47,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 27 treesize of output 36 [2023-02-15 09:49:47,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:47,499 INFO L321 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2023-02-15 09:49:47,500 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 3 case distinctions, treesize of input 54 treesize of output 62 [2023-02-15 09:49:48,723 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 09:49:48,723 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 897 treesize of output 838 [2023-02-15 09:49:48,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 136 [2023-02-15 09:49:48,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,891 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-02-15 09:49:48,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 26 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 502 treesize of output 589 [2023-02-15 09:49:48,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:48,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 302 [2023-02-15 09:49:49,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:49:49,182 INFO L217 Elim1Store]: Index analysis took 174 ms [2023-02-15 09:49:49,202 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-02-15 09:49:49,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 26 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 408 treesize of output 403 [2023-02-15 09:49:49,736 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 09:49:49,779 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 09:49:49,857 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 128 treesize of output 96 [2023-02-15 09:49:49,986 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 09:50:12,102 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 09:50:12,102 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 282 treesize of output 248 [2023-02-15 09:50:12,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:12,855 INFO L217 Elim1Store]: Index analysis took 634 ms [2023-02-15 09:50:14,422 INFO L321 Elim1Store]: treesize reduction 12, result has 89.7 percent of original size [2023-02-15 09:50:14,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 131 [2023-02-15 09:50:14,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:50:14,610 INFO L217 Elim1Store]: Index analysis took 121 ms [2023-02-15 09:50:15,057 INFO L321 Elim1Store]: treesize reduction 14, result has 88.4 percent of original size [2023-02-15 09:50:15,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 124 treesize of output 182 [2023-02-15 09:50:27,800 WARN L233 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 177 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 09:50:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 09:50:28,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 09:50:29,927 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse54 (mod (+ (* 4294967295 |c_ULTIMATE.start_main_~pivot~0#1|) |c_ULTIMATE.start_main_~index~0#1|) 4294967296)) (.cse55 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse51 (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |c_ULTIMATE.start_main_~index~0#1|) 4294967296)) (.cse16 (<= .cse55 2147483647)) (.cse53 (* .cse55 4)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse52 (* .cse54 4)) (.cse24 (<= .cse54 2147483647))) (let ((.cse1 (not .cse24)) (.cse14 (+ .cse52 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse23 (select .cse8 (+ .cse52 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (.cse19 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse53)) (.cse20 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse53)) (.cse15 (not .cse16)) (.cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8)) (.cse6 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse53)) (.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse53)) (.cse29 (+ (- 17179869184) .cse52 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse33 (select .cse8 (+ (- 17179869184) .cse52 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (.cse34 (* .cse51 4)) (.cse0 (<= .cse51 2147483647))) (and (or (not .cse0) (let ((.cse13 (+ .cse34 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse22 (select .cse8 (+ .cse34 |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) (and (or .cse1 (let ((.cse10 (+ .cse22 .cse23))) (and (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_212 (Array Int Int))) (= (let ((.cse2 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse11 (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse12 .cse13) (select .cse12 .cse14)))))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse8 .cse9 .cse10)) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse2) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse2 .cse3) (select .cse2 .cse4) (select .cse5 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse5 .cse6) |c_ULTIMATE.start_main_~sum~0#1| (select .cse5 .cse7)))) 0)) .cse15) (or .cse16 (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_212 (Array Int Int))) (= (let ((.cse17 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse20 (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse21 .cse13) (select .cse21 .cse14)))))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse8 .cse19 .cse10)) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse17) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse17 .cse3) (select .cse17 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse18 .cse6) (select .cse18 .cse7) (select .cse17 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse18 |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) 0)))))) (or .cse24 (let ((.cse27 (+ .cse22 .cse33))) (and (or .cse16 (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_212 (Array Int Int))) (= (let ((.cse25 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse20 (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse28 .cse29) (select .cse28 .cse13)))))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse8 .cse19 .cse27)) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse25) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse25 .cse3) |c_ULTIMATE.start_main_~sum~0#1| (select .cse26 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse26 .cse7) (select .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse25 .cse4) (select .cse26 .cse6)))) 0))) (or .cse15 (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_212 (Array Int Int))) (= (let ((.cse30 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse11 (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse32 .cse29) (select .cse32 .cse13)))))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse8 .cse9 .cse27)) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse30) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse30 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse31 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse30 .cse4) (select .cse30 .cse3) (select .cse31 .cse7) (select .cse31 .cse6)))) 0))))))))) (or (let ((.cse39 (+ .cse34 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse43 (select .cse8 (+ .cse34 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) (and (or .cse1 (let ((.cse37 (+ .cse43 .cse23))) (and (or .cse16 (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_212 (Array Int Int))) (= (let ((.cse36 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse20 (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse38 .cse14) (select .cse38 .cse39)))))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse8 .cse19 .cse37)) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse36) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse35 .cse7) (select .cse35 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse36 .cse3) |c_ULTIMATE.start_main_~sum~0#1| (select .cse36 .cse4) (select .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse35 .cse6)))) 0))) (or (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_212 (Array Int Int))) (= (let ((.cse40 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse11 (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse42 .cse14) (select .cse42 .cse39)))))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse8 .cse9 .cse37)) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse40) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse40 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse40 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse41 .cse7) (select .cse41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse41 .cse6) (select .cse40 .cse3)))) 0)) .cse15)))) (or (let ((.cse46 (+ .cse43 .cse33))) (and (or .cse16 (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_212 (Array Int Int))) (= (let ((.cse44 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse20 (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse47 .cse29) (select .cse47 .cse39)))))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse8 .cse19 .cse46)) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse44) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse44 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse44 .cse4) |c_ULTIMATE.start_main_~sum~0#1| (select .cse45 .cse7) (select .cse45 .cse6) (select .cse44 .cse3) (select .cse45 |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) 0))) (or .cse15 (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_212 (Array Int Int))) (= (let ((.cse48 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse11 (let ((.cse50 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse50 .cse29) (select .cse50 .cse39)))))) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse8 .cse9 .cse46)) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse48) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse48 .cse3) |c_ULTIMATE.start_main_~sum~0#1| (select .cse49 .cse7) (select .cse49 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse48 .cse4) (select .cse49 .cse6) (select .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))) 0))))) .cse24))) .cse0))))) (< 3 c_~ARR_SIZE~0) (not (< 0 c_~ARR_SIZE~0))) is different from false [2023-02-15 09:50:35,002 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse1 (* 4294967295 |c_ULTIMATE.start_main_~pivot~0#1|))) (let ((.cse33 (+ .cse1 4294967296)) (.cse2 (+ 2147483647 |c_ULTIMATE.start_main_~pivot~0#1|)) (.cse5 (+ .cse1 c_~ARR_SIZE~0)) (.cse17 (+ 2147483647 .cse1)) (.cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8)) (.cse9 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 4)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse18 (* |c_ULTIMATE.start_main_~pivot~0#1| 4294967297)) (.cse30 (+ |c_ULTIMATE.start_main_~pivot~0#1| 4294967296))) (and (forall ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_218 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112| Int) (|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_212 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_86| Int)) (let ((.cse19 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112|)) (.cse20 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296))) (let ((.cse3 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse20)) (.cse0 (+ .cse19 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse20)) (.cse4 (+ .cse19 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse20 (* |aux_div_ULTIMATE.start_main_~index~0#1_86| 4294967296)))) (or (>= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) (< .cse0 .cse1) (< .cse2 .cse3) (not (< .cse4 .cse5)) (<= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 2147483647) (= (let ((.cse13 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) 4)) (.cse15 (* 4 (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| |c_ULTIMATE.start_main_~pivot~0#1|) 4294967296))) (.cse14 (* (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse1) 4294967296) 4))) (let ((.cse8 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse13 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse16 (+ .cse15 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse16 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse14))))))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse12 (+ .cse13 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse14)) (select .cse12 (+ .cse15 |c_ULTIMATE.start_main_~#array1~0#1.offset|))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse8) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select .cse6 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse6 .cse7) (select .cse8 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse8 .cse9) (select .cse8 .cse10) (select .cse6 .cse11))))) 0) (< .cse3 |c_ULTIMATE.start_main_~pivot~0#1|) (< .cse17 .cse0) (not (<= .cse18 .cse4)))))) (forall ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_218 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112| Int) (|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_212 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_86| Int)) (let ((.cse32 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112|)) (.cse31 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296))) (let ((.cse22 (+ .cse32 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse31)) (.cse23 (+ .cse32 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse31 (* |aux_div_ULTIMATE.start_main_~index~0#1_86| 4294967296))) (.cse21 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse31))) (or (>= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) (<= .cse21 .cse2) (< .cse22 .cse1) (not (< .cse23 .cse5)) (<= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 2147483647) (< .cse17 .cse22) (= (let ((.cse26 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) 4)) (.cse28 (* 4 (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| |c_ULTIMATE.start_main_~pivot~0#1|) 4294967296))) (.cse27 (* (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse1) 4294967296) 4))) (let ((.cse25 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse26 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse29 (+ .cse28 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse29 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse27))))))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse12 (+ .cse26 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (select .cse12 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse27)) (select .cse12 (+ .cse28 |c_ULTIMATE.start_main_~#array1~0#1.offset|))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse25) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse25 .cse10) (select .cse24 .cse11) (select .cse24 .cse7) (select .cse25 .cse9))))) 0) (not (<= .cse18 .cse23)) (<= .cse30 .cse21))))) (forall ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_218 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112| Int) (|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_212 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_86| Int)) (let ((.cse43 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112|)) (.cse44 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296))) (let ((.cse34 (+ .cse43 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse44)) (.cse35 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse44)) (.cse42 (+ .cse43 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse44 (* |aux_div_ULTIMATE.start_main_~index~0#1_86| 4294967296)))) (or (<= .cse33 .cse34) (< .cse2 .cse35) (< 2147483647 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109|) (= (let ((.cse38 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) 4)) (.cse40 (* 4 (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| |c_ULTIMATE.start_main_~pivot~0#1|) 4294967296))) (.cse39 (* (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse1) 4294967296) 4))) (let ((.cse37 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse41 (+ .cse40 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse41 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39))))))) (let ((.cse36 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse12 (+ .cse38 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse39)) (select .cse12 (+ .cse40 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse37) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse36 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse36 .cse11) |c_ULTIMATE.start_main_~sum~0#1| (select .cse37 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse36 .cse7) (select .cse37 .cse10) (select .cse37 .cse9))))) 0) (not (< .cse42 .cse5)) (<= .cse34 .cse17) (< .cse35 |c_ULTIMATE.start_main_~pivot~0#1|) (> 0 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109|) (not (<= .cse18 .cse42)))))) (forall ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_218 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112| Int) (|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_212 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_86| Int)) (let ((.cse54 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112|)) (.cse55 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296))) (let ((.cse45 (+ .cse54 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse55)) (.cse52 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse55)) (.cse53 (+ .cse54 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse55 (* |aux_div_ULTIMATE.start_main_~index~0#1_86| 4294967296)))) (or (<= .cse33 .cse45) (>= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) (= (let ((.cse48 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) 4)) (.cse50 (* 4 (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| |c_ULTIMATE.start_main_~pivot~0#1|) 4294967296))) (.cse49 (* (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse1) 4294967296) 4))) (let ((.cse47 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse48 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse51 (+ .cse50 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse51 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse49))))))) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse12 (+ .cse48 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse49)) (select .cse12 (+ .cse50 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse47) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse46 .cse11) (select .cse46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse46 .cse7) (select .cse47 .cse10) |c_ULTIMATE.start_main_~sum~0#1| (select .cse47 .cse9) (select .cse47 |c_ULTIMATE.start_main_~#array2~0#1.offset|))))) 0) (< .cse2 .cse52) (not (< .cse53 .cse5)) (<= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 2147483647) (<= .cse45 .cse17) (< .cse52 |c_ULTIMATE.start_main_~pivot~0#1|) (not (<= .cse18 .cse53)))))) (forall ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_218 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112| Int) (|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_212 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_86| Int)) (let ((.cse66 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112|)) (.cse65 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296))) (let ((.cse57 (+ .cse66 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse65)) (.cse64 (+ .cse66 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse65 (* |aux_div_ULTIMATE.start_main_~index~0#1_86| 4294967296))) (.cse56 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse65))) (or (<= .cse56 .cse2) (< .cse57 .cse1) (< 2147483647 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109|) (= (let ((.cse60 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) 4)) (.cse62 (* 4 (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| |c_ULTIMATE.start_main_~pivot~0#1|) 4294967296))) (.cse61 (* (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse1) 4294967296) 4))) (let ((.cse59 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse60 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse63 (+ .cse62 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse63 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse61))))))) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse12 (+ .cse60 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (select .cse12 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse61)) (select .cse12 (+ .cse62 |c_ULTIMATE.start_main_~#array1~0#1.offset|))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse59) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse58 .cse7) |c_ULTIMATE.start_main_~sum~0#1| (select .cse59 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse58 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse58 .cse11) (select .cse59 .cse10) (select .cse59 .cse9))))) 0) (not (< .cse64 .cse5)) (< .cse17 .cse57) (> 0 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109|) (not (<= .cse18 .cse64)) (<= .cse30 .cse56))))) (forall ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_218 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112| Int) (|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_212 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_86| Int)) (let ((.cse76 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112|)) (.cse77 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296))) (let ((.cse68 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse77)) (.cse67 (+ .cse76 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse77)) (.cse69 (+ .cse76 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse77 (* |aux_div_ULTIMATE.start_main_~index~0#1_86| 4294967296)))) (or (< .cse67 .cse1) (< .cse2 .cse68) (< 2147483647 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109|) (not (< .cse69 .cse5)) (= (let ((.cse72 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) 4)) (.cse74 (* 4 (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| |c_ULTIMATE.start_main_~pivot~0#1|) 4294967296))) (.cse73 (* (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse1) 4294967296) 4))) (let ((.cse71 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse72 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse75 (+ .cse74 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse75 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse73))))))) (let ((.cse70 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse12 (+ .cse72 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (select .cse12 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse73)) (select .cse12 (+ .cse74 |c_ULTIMATE.start_main_~#array1~0#1.offset|))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse71) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse70 |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse71 .cse10) (select .cse70 .cse11) (select .cse70 .cse7) (select .cse71 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse71 .cse9))))) 0) (< .cse68 |c_ULTIMATE.start_main_~pivot~0#1|) (< .cse17 .cse67) (> 0 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109|) (not (<= .cse18 .cse69)))))) (forall ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_218 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112| Int) (|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_212 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_86| Int)) (let ((.cse88 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112|)) (.cse87 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296))) (let ((.cse78 (+ .cse88 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse87)) (.cse80 (+ .cse88 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse87 (* |aux_div_ULTIMATE.start_main_~index~0#1_86| 4294967296))) (.cse79 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse87))) (or (<= .cse33 .cse78) (>= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) (<= .cse79 .cse2) (not (< .cse80 .cse5)) (<= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 2147483647) (<= .cse78 .cse17) (= (let ((.cse83 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) 4)) (.cse84 (* 4 (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| |c_ULTIMATE.start_main_~pivot~0#1|) 4294967296))) (.cse85 (* (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse1) 4294967296) 4))) (let ((.cse81 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse83 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|) (let ((.cse86 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse86 (+ .cse84 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse86 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse85))))))) (let ((.cse82 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse12 (+ .cse83 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (select .cse12 (+ .cse84 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (select .cse12 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse85))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse81) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse81 .cse9) (select .cse82 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse81 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse82 .cse11) (select .cse81 .cse10) (select .cse82 .cse7))))) 0) (not (<= .cse18 .cse80)) (<= .cse30 .cse79))))) (forall ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_218 (Array Int Int)) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112| Int) (|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| Int) (v_ArrVal_212 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~index~0#1_86| Int)) (let ((.cse99 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_86_112|)) (.cse98 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296))) (let ((.cse89 (+ .cse99 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse98)) (.cse91 (+ .cse99 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse98 (* |aux_div_ULTIMATE.start_main_~index~0#1_86| 4294967296))) (.cse90 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse98))) (or (<= .cse33 .cse89) (<= .cse90 .cse2) (< 2147483647 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109|) (not (< .cse91 .cse5)) (<= .cse89 .cse17) (> 0 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109|) (= (let ((.cse94 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| 4294967296) 4)) (.cse95 (* 4 (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| |c_ULTIMATE.start_main_~pivot~0#1|) 4294967296))) (.cse96 (* (mod (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_86_112_109| .cse1) 4294967296) 4))) (let ((.cse93 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse94 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (let ((.cse97 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse97 (+ .cse95 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse97 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse96))))))) (let ((.cse92 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse12 (+ .cse94 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (select .cse12 (+ .cse95 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (select .cse12 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse96))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse93) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse92 .cse11) (select .cse92 |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse92 .cse7) (select .cse93 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse93 .cse10) (select .cse93 .cse9))))) 0) (not (<= .cse18 .cse91)) (<= .cse30 .cse90)))))))) (< 3 c_~ARR_SIZE~0) (not (< 0 c_~ARR_SIZE~0))) is different from true [2023-02-15 09:50:35,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:50:35,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359182546] [2023-02-15 09:50:35,008 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 09:50:35,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959815281] [2023-02-15 09:50:35,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959815281] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 09:50:35,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-15 09:50:35,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2023-02-15 09:50:35,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107393844] [2023-02-15 09:50:35,009 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-15 09:50:35,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 09:50:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:50:35,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 09:50:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=884, Unknown=4, NotChecked=126, Total=1190 [2023-02-15 09:50:35,011 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:50:50,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 09:50:59,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 09:50:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:50:59,353 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2023-02-15 09:50:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 09:50:59,354 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2023-02-15 09:50:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:50:59,356 INFO L225 Difference]: With dead ends: 44 [2023-02-15 09:50:59,356 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 09:50:59,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=372, Invalid=1791, Unknown=7, NotChecked=182, Total=2352 [2023-02-15 09:50:59,358 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-02-15 09:50:59,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 123 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 251 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2023-02-15 09:50:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 09:50:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2023-02-15 09:50:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:50:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-02-15 09:50:59,367 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 39 [2023-02-15 09:50:59,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:50:59,368 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-02-15 09:50:59,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:50:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-02-15 09:50:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 09:50:59,369 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:50:59,369 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:50:59,380 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-15 09:50:59,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:50:59,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:50:59,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:50:59,571 INFO L85 PathProgramCache]: Analyzing trace with hash -883530364, now seen corresponding path program 4 times [2023-02-15 09:50:59,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:50:59,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851197923] [2023-02-15 09:50:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:50:59,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:50:59,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:50:59,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972063595] [2023-02-15 09:50:59,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 09:50:59,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:50:59,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:50:59,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 09:50:59,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 09:50:59,675 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 09:50:59,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 09:50:59,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 09:50:59,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:50:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 09:50:59,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 09:50:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 09:50:59,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 09:50:59,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851197923] [2023-02-15 09:50:59,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 09:50:59,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972063595] [2023-02-15 09:50:59,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972063595] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 09:50:59,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 09:50:59,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2023-02-15 09:50:59,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722303839] [2023-02-15 09:50:59,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 09:50:59,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 09:50:59,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 09:50:59,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 09:50:59,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-15 09:50:59,866 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 09:51:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 09:51:00,011 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2023-02-15 09:51:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 09:51:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-02-15 09:51:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 09:51:00,013 INFO L225 Difference]: With dead ends: 65 [2023-02-15 09:51:00,013 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 09:51:00,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2023-02-15 09:51:00,014 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 51 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 09:51:00,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 115 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 09:51:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 09:51:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-02-15 09:51:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 09:51:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-02-15 09:51:00,025 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 41 [2023-02-15 09:51:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 09:51:00,026 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-02-15 09:51:00,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 09:51:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-02-15 09:51:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 09:51:00,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 09:51:00,028 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 09:51:00,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 09:51:00,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:51:00,233 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 09:51:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 09:51:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1451589122, now seen corresponding path program 5 times [2023-02-15 09:51:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 09:51:00,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893478296] [2023-02-15 09:51:00,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 09:51:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 09:51:00,246 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 09:51:00,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692500071] [2023-02-15 09:51:00,246 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 09:51:00,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 09:51:00,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 09:51:00,248 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 09:51:00,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 09:51:00,717 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-02-15 09:51:00,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 09:51:00,720 WARN L261 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 101 conjunts are in the unsatisfiable core [2023-02-15 09:51:00,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 09:51:00,733 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-15 09:51:00,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:00,754 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 32 treesize of output 36 [2023-02-15 09:51:00,759 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 33 treesize of output 33 [2023-02-15 09:51:00,763 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 15 treesize of output 14 [2023-02-15 09:51:00,770 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-15 09:51:00,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:00,845 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 47 treesize of output 46 [2023-02-15 09:51:00,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:00,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 09:51:00,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:00,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:00,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2023-02-15 09:51:00,970 INFO L321 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-02-15 09:51:00,971 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 2 case distinctions, treesize of input 122 treesize of output 102 [2023-02-15 09:51:00,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2023-02-15 09:51:00,995 INFO L321 Elim1Store]: treesize reduction 51, result has 8.9 percent of original size [2023-02-15 09:51:00,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 81 [2023-02-15 09:51:01,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:01,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:01,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2023-02-15 09:51:01,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:01,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:01,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2023-02-15 09:51:01,035 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 09:51:01,067 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 09:51:01,068 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 51 [2023-02-15 09:51:01,080 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 11 treesize of output 5 [2023-02-15 09:51:01,220 INFO L321 Elim1Store]: treesize reduction 30, result has 14.3 percent of original size [2023-02-15 09:51:01,221 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 2 case distinctions, treesize of input 137 treesize of output 116 [2023-02-15 09:51:01,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2023-02-15 09:51:01,245 INFO L321 Elim1Store]: treesize reduction 51, result has 8.9 percent of original size [2023-02-15 09:51:01,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 88 [2023-02-15 09:51:01,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:01,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:01,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:01,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-02-15 09:51:01,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:01,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:01,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:01,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 58 [2023-02-15 09:51:01,297 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 11 treesize of output 5 [2023-02-15 09:51:02,443 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 09:51:02,444 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 1115 treesize of output 1032 [2023-02-15 09:51:02,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,609 INFO L321 Elim1Store]: treesize reduction 122, result has 0.8 percent of original size [2023-02-15 09:51:02,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 39 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 451 treesize of output 542 [2023-02-15 09:51:02,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 298 [2023-02-15 09:51:02,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:02,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,054 INFO L217 Elim1Store]: Index analysis took 295 ms [2023-02-15 09:51:03,114 INFO L321 Elim1Store]: treesize reduction 122, result has 0.8 percent of original size [2023-02-15 09:51:03,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 39 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 580 treesize of output 487 [2023-02-15 09:51:03,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 133 [2023-02-15 09:51:03,561 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 09:51:03,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:03,941 INFO L217 Elim1Store]: Index analysis took 332 ms [2023-02-15 09:51:04,101 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 09:51:04,277 INFO L321 Elim1Store]: treesize reduction 85, result has 26.1 percent of original size [2023-02-15 09:51:04,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 39 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 124 [2023-02-15 09:51:04,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 13 [2023-02-15 09:51:04,578 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 21 treesize of output 13 [2023-02-15 09:51:04,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 09:51:04,777 INFO L321 Elim1Store]: treesize reduction 107, result has 23.0 percent of original size [2023-02-15 09:51:04,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 39 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 6 case distinctions, treesize of input 394 treesize of output 276 [2023-02-15 09:51:09,320 INFO L321 Elim1Store]: treesize reduction 1208, result has 27.8 percent of original size [2023-02-15 09:51:09,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 265 treesize of output 575