./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 b5317dae 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-?-b5317da-m [2023-02-16 00:10:49,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:10:49,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:10:49,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:10:49,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:10:49,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:10:49,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:10:49,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:10:49,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:10:49,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:10:49,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:10:49,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:10:49,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:10:49,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:10:49,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:10:49,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:10:49,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:10:49,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:10:49,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:10:49,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:10:49,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:10:49,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:10:49,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:10:49,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:10:49,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:10:49,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:10:49,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:10:49,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:10:49,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:10:49,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:10:49,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:10:49,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:10:49,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:10:49,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:10:49,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:10:49,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:10:49,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:10:49,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:10:49,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:10:49,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:10:49,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:10:49,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:10:49,188 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:10:49,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:10:49,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:10:49,207 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:10:49,208 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:10:49,208 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:10:49,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:10:49,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:10:49,209 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:10:49,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:10:49,211 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:10:49,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:10:49,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:10:49,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:10:49,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:10:49,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:10:49,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:10:49,212 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:10:49,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:10:49,212 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:10:49,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:10:49,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:10:49,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:10:49,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:10:49,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:10:49,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:10:49,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:10:49,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:10:49,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:10:49,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:10:49,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:10:49,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:10:49,216 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:10:49,216 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:10:49,216 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:10:49,216 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-16 00:10:49,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:10:49,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:10:49,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:10:49,559 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:10:49,559 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:10:49,560 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-16 00:10:51,117 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:10:51,331 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:10:51,332 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array7_pattern.c [2023-02-16 00:10:51,341 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/415b9568c/bd5588bf70634c49b0587c6f5caa64f2/FLAG9907f25fb [2023-02-16 00:10:51,361 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/415b9568c/bd5588bf70634c49b0587c6f5caa64f2 [2023-02-16 00:10:51,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:10:51,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:10:51,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:10:51,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:10:51,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:10:51,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ae65de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51, skipping insertion in model container [2023-02-16 00:10:51,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:10:51,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:10:51,733 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-16 00:10:51,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:10:51,778 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:10:51,792 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-16 00:10:51,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:10:51,852 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:10:51,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51 WrapperNode [2023-02-16 00:10:51,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:10:51,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:10:51,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:10:51,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:10:51,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,930 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2023-02-16 00:10:51,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:10:51,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:10:51,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:10:51,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:10:51,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,998 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:51,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:52,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:10:52,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:10:52,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:10:52,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:10:52,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (1/1) ... [2023-02-16 00:10:52,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:10:52,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:10:52,071 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-16 00:10:52,079 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-16 00:10:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:10:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-16 00:10:52,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-16 00:10:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:10:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:10:52,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:10:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:10:52,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:10:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:10:52,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:10:52,218 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:10:52,220 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:10:52,423 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:10:52,428 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:10:52,428 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 00:10:52,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:10:52 BoogieIcfgContainer [2023-02-16 00:10:52,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:10:52,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:10:52,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:10:52,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:10:52,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:10:51" (1/3) ... [2023-02-16 00:10:52,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acfaefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:10:52, skipping insertion in model container [2023-02-16 00:10:52,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:10:51" (2/3) ... [2023-02-16 00:10:52,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acfaefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:10:52, skipping insertion in model container [2023-02-16 00:10:52,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:10:52" (3/3) ... [2023-02-16 00:10:52,439 INFO L112 eAbstractionObserver]: Analyzing ICFG array7_pattern.c [2023-02-16 00:10:52,456 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:10:52,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:10:52,505 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:10:52,512 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;@359e9335, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:10:52,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:10:52,516 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-16 00:10:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 00:10:52,523 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:10:52,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:10:52,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:10:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:10:52,528 INFO L85 PathProgramCache]: Analyzing trace with hash -440982883, now seen corresponding path program 1 times [2023-02-16 00:10:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:10:52,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217092041] [2023-02-16 00:10:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:10:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:10:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 00:10:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:52,782 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-16 00:10:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:10:52,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217092041] [2023-02-16 00:10:52,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217092041] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:10:52,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:10:52,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:10:52,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600583974] [2023-02-16 00:10:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:10:52,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:10:52,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:10:52,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:10:52,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:10:52,875 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-16 00:10:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:10:52,902 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2023-02-16 00:10:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:10:52,905 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-16 00:10:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:10:52,911 INFO L225 Difference]: With dead ends: 49 [2023-02-16 00:10:52,912 INFO L226 Difference]: Without dead ends: 22 [2023-02-16 00:10:52,915 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-16 00:10:52,919 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-16 00:10:52,921 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-16 00:10:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-16 00:10:52,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-16 00:10:52,954 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-16 00:10:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-02-16 00:10:52,958 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2023-02-16 00:10:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:10:52,959 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-02-16 00:10:52,959 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-16 00:10:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-02-16 00:10:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 00:10:52,988 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:10:52,989 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-16 00:10:52,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:10:52,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:10:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:10:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1396045698, now seen corresponding path program 1 times [2023-02-16 00:10:52,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:10:52,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948162791] [2023-02-16 00:10:52,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:10:52,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:10:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:53,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 00:10:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:53,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 00:10:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:53,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-16 00:10:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:53,508 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-16 00:10:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:10:53,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948162791] [2023-02-16 00:10:53,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948162791] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:10:53,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:10:53,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:10:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908331633] [2023-02-16 00:10:53,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:10:53,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:10:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:10:53,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:10:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:10:53,520 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-16 00:10:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:10:53,571 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-02-16 00:10:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:10:53,572 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-16 00:10:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:10:53,573 INFO L225 Difference]: With dead ends: 27 [2023-02-16 00:10:53,573 INFO L226 Difference]: Without dead ends: 23 [2023-02-16 00:10:53,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:10:53,575 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-16 00:10:53,575 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-16 00:10:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-16 00:10:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-16 00:10:53,590 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-16 00:10:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-16 00:10:53,591 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 27 [2023-02-16 00:10:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:10:53,594 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-16 00:10:53,594 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-16 00:10:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-16 00:10:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:10:53,598 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:10:53,599 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-16 00:10:53,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:10:53,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:10:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:10:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1623352868, now seen corresponding path program 1 times [2023-02-16 00:10:53,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:10:53,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885854085] [2023-02-16 00:10:53,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:10:53,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:10:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:53,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 00:10:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:53,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 00:10:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:53,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-16 00:10:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:53,829 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-16 00:10:53,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:10:53,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885854085] [2023-02-16 00:10:53,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885854085] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:10:53,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:10:53,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:10:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305153026] [2023-02-16 00:10:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:10:53,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:10:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:10:53,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:10:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:10:53,837 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-16 00:10:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:10:53,911 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-02-16 00:10:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:10:53,912 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-16 00:10:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:10:53,914 INFO L225 Difference]: With dead ends: 43 [2023-02-16 00:10:53,915 INFO L226 Difference]: Without dead ends: 26 [2023-02-16 00:10:53,915 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-16 00:10:53,917 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:10:53,920 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.1s Time] [2023-02-16 00:10:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-16 00:10:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-02-16 00:10:53,926 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-16 00:10:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-02-16 00:10:53,929 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2023-02-16 00:10:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:10:53,929 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-02-16 00:10:53,929 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-16 00:10:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-02-16 00:10:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 00:10:53,930 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:10:53,931 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-16 00:10:53,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 00:10:53,931 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:10:53,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:10:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1083978846, now seen corresponding path program 1 times [2023-02-16 00:10:53,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:10:53,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816178913] [2023-02-16 00:10:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:10:53,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:10:53,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:10:53,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2061959478] [2023-02-16 00:10:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:10:53,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:10:53,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:10:53,973 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-16 00:10:53,990 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-16 00:10:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:10:54,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 00:10:54,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:10:54,250 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-16 00:10:54,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:10:54,464 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-16 00:10:54,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:10:54,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816178913] [2023-02-16 00:10:54,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:10:54,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061959478] [2023-02-16 00:10:54,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061959478] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:10:54,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:10:54,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2023-02-16 00:10:54,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682293850] [2023-02-16 00:10:54,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:10:54,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 00:10:54,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:10:54,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 00:10:54,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-02-16 00:10:54,475 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-16 00:10:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:10:54,719 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-02-16 00:10:54,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 00:10:54,720 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-16 00:10:54,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:10:54,722 INFO L225 Difference]: With dead ends: 73 [2023-02-16 00:10:54,722 INFO L226 Difference]: Without dead ends: 42 [2023-02-16 00:10:54,724 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-16 00:10:54,730 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-16 00:10:54,732 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-16 00:10:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-16 00:10:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2023-02-16 00:10:54,742 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-16 00:10:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-16 00:10:54,744 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 31 [2023-02-16 00:10:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:10:54,745 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-16 00:10:54,745 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-16 00:10:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-16 00:10:54,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 00:10:54,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:10:54,747 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-16 00:10:54,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:10:54,957 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-16 00:10:54,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:10:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:10:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1214758882, now seen corresponding path program 2 times [2023-02-16 00:10:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:10:54,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214231745] [2023-02-16 00:10:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:10:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:10:54,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:10:54,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856790383] [2023-02-16 00:10:54,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:10:54,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:10:54,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:10:55,005 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-16 00:10:55,049 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-16 00:10:55,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:10:55,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:10:55,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 00:10:55,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:10:55,266 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-16 00:10:55,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:10:55,335 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-16 00:10:55,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:10:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214231745] [2023-02-16 00:10:55,337 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:10:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856790383] [2023-02-16 00:10:55,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856790383] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:10:55,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:10:55,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-02-16 00:10:55,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866560700] [2023-02-16 00:10:55,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:10:55,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:10:55,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:10:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:10:55,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:10:55,341 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-16 00:10:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:10:55,488 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-02-16 00:10:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:10:55,488 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-16 00:10:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:10:55,489 INFO L225 Difference]: With dead ends: 40 [2023-02-16 00:10:55,490 INFO L226 Difference]: Without dead ends: 36 [2023-02-16 00:10:55,490 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-16 00:10:55,491 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-16 00:10:55,492 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-16 00:10:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-16 00:10:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-02-16 00:10:55,497 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-16 00:10:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2023-02-16 00:10:55,498 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 35 [2023-02-16 00:10:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:10:55,498 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2023-02-16 00:10:55,499 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-16 00:10:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2023-02-16 00:10:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 00:10:55,500 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:10:55,500 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-16 00:10:55,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:10:55,707 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-16 00:10:55,707 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:10:55,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:10:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1618850078, now seen corresponding path program 3 times [2023-02-16 00:10:55,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:10:55,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973766412] [2023-02-16 00:10:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:10:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:10:55,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:10:55,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538504838] [2023-02-16 00:10:55,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:10:55,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:10:55,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:10:55,739 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-16 00:10:55,780 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-16 00:10:56,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-16 00:10:56,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:10:56,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 85 conjunts are in the unsatisfiable core [2023-02-16 00:10:56,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:10:56,144 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-16 00:10:56,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,217 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-16 00:10:56,226 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-16 00:10:56,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 15 treesize of output 14 [2023-02-16 00:10:56,255 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-16 00:10:56,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,371 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-16 00:10:56,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,390 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-16 00:10:56,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,422 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 44 treesize of output 49 [2023-02-16 00:10:56,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,682 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-16 00:10:56,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,707 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 27 treesize of output 36 [2023-02-16 00:10:56,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:56,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2023-02-16 00:10:58,118 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:10:58,118 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 1172 treesize of output 1087 [2023-02-16 00:10:58,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,523 INFO L217 Elim1Store]: Index analysis took 319 ms [2023-02-16 00:10:58,556 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-02-16 00:10:58,556 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 431 treesize of output 518 [2023-02-16 00:10:58,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:10:58,809 INFO L217 Elim1Store]: Index analysis took 202 ms [2023-02-16 00:10:58,961 INFO L321 Elim1Store]: treesize reduction 185, result has 0.5 percent of original size [2023-02-16 00:10:58,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 7 select indices, 7 select index equivalence classes, 31 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 7 case distinctions, treesize of input 657 treesize of output 1315 [2023-02-16 00:11:02,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:02,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:02,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,359 INFO L321 Elim1Store]: treesize reduction 245, result has 5.4 percent of original size [2023-02-16 00:11:03,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 374 treesize of output 782 [2023-02-16 00:11:03,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,587 INFO L217 Elim1Store]: Index analysis took 176 ms [2023-02-16 00:11:03,763 INFO L321 Elim1Store]: treesize reduction 166, result has 0.6 percent of original size [2023-02-16 00:11:03,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 426 treesize of output 567 [2023-02-16 00:11:03,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:03,903 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 84 treesize of output 40 [2023-02-16 00:11:13,958 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 00:11:13,959 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 250 treesize of output 216 [2023-02-16 00:11:13,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:13,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:13,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:13,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,480 INFO L321 Elim1Store]: treesize reduction 12, result has 94.1 percent of original size [2023-02-16 00:11:14,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 130 treesize of output 256 [2023-02-16 00:11:14,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:11:14,833 INFO L321 Elim1Store]: treesize reduction 12, result has 90.7 percent of original size [2023-02-16 00:11:14,833 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 147 treesize of output 197 [2023-02-16 00:11:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:11:27,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:13:29,416 WARN L233 SmtUtils]: Spent 1.16m on a formula simplification that was a NOOP. DAG size: 218 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:15:10,391 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse21 (* 4294967297 |c_ULTIMATE.start_main_~pivot~0#1|)) (.cse59 (* 4294967295 |c_ULTIMATE.start_main_~pivot~0#1|))) (let ((.cse6 (+ .cse59 4294967296)) (.cse34 (+ .cse21 4294967296)) (.cse2 (+ .cse21 2147483647)) (.cse5 (+ (* 8589934591 |c_ULTIMATE.start_main_~pivot~0#1|) c_~ARR_SIZE~0)) (.cse7 (* 8589934593 |c_ULTIMATE.start_main_~pivot~0#1|)) (.cse1 (+ .cse59 2147483647)) (.cse13 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8)) (.cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (.cse12 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8)) (.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse20 (* |c_ULTIMATE.start_main_~pivot~0#1| 4294967295))) (and (forall ((|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_101| Int)) (let ((.cse23 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104|)) (.cse22 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|))) (let ((.cse0 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse22)) (.cse4 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse22 .cse23 (* 4294967296 |aux_div_ULTIMATE.start_main_~index~0#1_101|))) (.cse3 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse22 .cse23))) (or (<= .cse0 .cse1) (< .cse2 .cse3) (> 0 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) (not (< .cse4 .cse5)) (<= .cse6 .cse0) (< 2147483647 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) (not (<= .cse7 .cse4)) (= 0 (let ((.cse16 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) 4)) (.cse17 (* (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4)) (.cse18 (* (mod (+ .cse20 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16) (+ (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse17 (- 17179869184))) (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18))))))) (let ((.cse10 (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (store .cse15 (+ .cse16 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (+ (select .cse15 (+ .cse17 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse15 (+ .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|))))))) (let ((.cse8 (select (store .cse14 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse10) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse8 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse8 .cse9) (select .cse10 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse10 .cse11) (select .cse10 .cse12) (select .cse8 .cse13))))))) (< .cse3 .cse21))))) (forall ((|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_101| Int)) (let ((.cse36 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104|)) (.cse35 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|))) (let ((.cse24 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse35)) (.cse26 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse35 .cse36 (* 4294967296 |aux_div_ULTIMATE.start_main_~index~0#1_101|))) (.cse25 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse35 .cse36))) (or (<= .cse24 .cse1) (>= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) (<= .cse25 .cse2) (not (< .cse26 .cse5)) (<= .cse6 .cse24) (not (<= .cse7 .cse26)) (= 0 (let ((.cse31 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) 4)) (.cse32 (* (mod (+ .cse20 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4)) (.cse33 (* (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse31 (- 17179869184)) (+ (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse32 (- 17179869184))) (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse33 (- 17179869184)))))))) (let ((.cse27 (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (store .cse30 (+ .cse31 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)) (+ (select .cse30 (+ .cse32 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse30 (+ .cse33 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))))))) (let ((.cse28 (select (store .cse29 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse27) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse27 .cse12) (select .cse28 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse28 .cse13) |c_ULTIMATE.start_main_~sum~0#1| (select .cse27 .cse11) (select .cse28 .cse9) (select .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|))))))) (<= .cse34 .cse25) (<= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 2147483647))))) (forall ((|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_101| Int)) (let ((.cse48 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104|)) (.cse47 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|))) (let ((.cse37 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse47)) (.cse39 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse47 .cse48 (* 4294967296 |aux_div_ULTIMATE.start_main_~index~0#1_101|))) (.cse38 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse47 .cse48))) (or (<= .cse37 .cse1) (< .cse2 .cse38) (>= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) (not (< .cse39 .cse5)) (<= .cse6 .cse37) (= 0 (let ((.cse44 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) 4)) (.cse45 (* (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4)) (.cse46 (* (mod (+ .cse20 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse44 (- 17179869184)) (+ (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse45 (- 17179869184))) (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse46))))))) (let ((.cse40 (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (store .cse43 (+ .cse44 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)) (+ (select .cse43 (+ .cse45 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse43 (+ .cse46 |c_ULTIMATE.start_main_~#array2~0#1.offset|))))))) (let ((.cse41 (select (store .cse42 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse40) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse40 .cse11) (select .cse41 .cse13) (select .cse40 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse41 |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse41 .cse9) (select .cse40 .cse12))))))) (not (<= .cse7 .cse39)) (< .cse38 .cse21) (<= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 2147483647))))) (forall ((|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_101| Int)) (let ((.cse60 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|)) (.cse61 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104|))) (let ((.cse50 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse60 .cse61 (* 4294967296 |aux_div_ULTIMATE.start_main_~index~0#1_101|))) (.cse49 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse60 .cse61)) (.cse51 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse60))) (or (>= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) (<= .cse49 .cse2) (not (< .cse50 .cse5)) (not (<= .cse7 .cse50)) (< .cse1 .cse51) (<= .cse34 .cse49) (= 0 (let ((.cse56 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) 4)) (.cse58 (* (mod (+ .cse20 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4)) (.cse57 (* (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse56 (- 17179869184)) (+ (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse58 (- 17179869184))) (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse57))))))) (let ((.cse53 (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (store .cse55 (+ .cse56 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)) (+ (select .cse55 (+ .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse55 (+ .cse58 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))))))) (let ((.cse52 (select (store .cse54 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse53) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse52 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse52 .cse9) (select .cse53 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse53 .cse11) |c_ULTIMATE.start_main_~sum~0#1| (select .cse52 .cse13) (select .cse53 .cse12))))))) (<= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 2147483647) (< .cse51 .cse59))))) (forall ((|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_101| Int)) (let ((.cse72 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|)) (.cse73 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104|))) (let ((.cse63 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse72 .cse73 (* 4294967296 |aux_div_ULTIMATE.start_main_~index~0#1_101|))) (.cse62 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse72 .cse73)) (.cse71 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse72))) (or (> 0 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) (<= .cse62 .cse2) (not (< .cse63 .cse5)) (< 2147483647 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) (not (<= .cse7 .cse63)) (= 0 (let ((.cse68 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) 4)) (.cse70 (* (mod (+ .cse20 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4)) (.cse69 (* (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse68) (+ (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse70 (- 17179869184))) (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse69))))))) (let ((.cse65 (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (store .cse67 (+ .cse68 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (+ (select .cse67 (+ .cse69 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse67 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))))))) (let ((.cse64 (select (store .cse66 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse65) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse64 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse65 .cse12) (select .cse65 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse65 .cse11) |c_ULTIMATE.start_main_~sum~0#1| (select .cse64 .cse9) (select .cse64 .cse13))))))) (< .cse1 .cse71) (<= .cse34 .cse62) (< .cse71 .cse59))))) (forall ((|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_101| Int)) (let ((.cse85 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104|)) (.cse84 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|))) (let ((.cse74 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse84)) (.cse83 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse84 .cse85 (* 4294967296 |aux_div_ULTIMATE.start_main_~index~0#1_101|))) (.cse75 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse84 .cse85))) (or (<= .cse74 .cse1) (> 0 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) (<= .cse75 .cse2) (= 0 (let ((.cse80 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) 4)) (.cse82 (* (mod (+ .cse20 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4)) (.cse81 (* (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse80) (+ (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse82 (- 17179869184))) (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse81 (- 17179869184)))))))) (let ((.cse77 (let ((.cse79 (select .cse78 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (store .cse79 (+ .cse80 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (+ (select .cse79 (+ .cse81 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse79 (+ .cse82 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))))))) (let ((.cse76 (select (store .cse78 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse77) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse76 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse76 .cse9) (select .cse77 .cse11) |c_ULTIMATE.start_main_~sum~0#1| (select .cse76 .cse13) (select .cse77 .cse12) (select .cse77 |c_ULTIMATE.start_main_~#array2~0#1.offset|))))))) (not (< .cse83 .cse5)) (<= .cse6 .cse74) (< 2147483647 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) (not (<= .cse7 .cse83)) (<= .cse34 .cse75))))) (forall ((|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_101| Int)) (let ((.cse96 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|)) (.cse97 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104|))) (let ((.cse87 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse96 .cse97 (* 4294967296 |aux_div_ULTIMATE.start_main_~index~0#1_101|))) (.cse86 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse96 .cse97)) (.cse88 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse96))) (or (< .cse2 .cse86) (>= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) (not (< .cse87 .cse5)) (not (<= .cse7 .cse87)) (< .cse1 .cse88) (< .cse86 .cse21) (= 0 (let ((.cse93 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) 4)) (.cse94 (* (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4)) (.cse95 (* (mod (+ .cse20 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4))) (let ((.cse91 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse93 (- 17179869184)) (+ (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse94)) (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse95))))))) (let ((.cse89 (let ((.cse92 (select .cse91 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (store .cse92 (+ .cse93 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)) (+ (select .cse92 (+ .cse94 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse92 (+ .cse95 |c_ULTIMATE.start_main_~#array2~0#1.offset|))))))) (let ((.cse90 (select (store .cse91 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse89) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse89 .cse12) (select .cse90 .cse9) (select .cse90 .cse13) (select .cse89 .cse11) |c_ULTIMATE.start_main_~sum~0#1| (select .cse90 |c_ULTIMATE.start_main_~#array1~0#1.offset|))))))) (<= |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 2147483647) (< .cse88 .cse59))))) (forall ((|aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_101| Int)) (let ((.cse108 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|)) (.cse109 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_101_104|))) (let ((.cse99 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse108 .cse109 (* 4294967296 |aux_div_ULTIMATE.start_main_~index~0#1_101|))) (.cse98 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse108 .cse109)) (.cse100 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| .cse108))) (or (< .cse2 .cse98) (> 0 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) (not (< .cse99 .cse5)) (< 2147483647 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) (not (<= .cse7 .cse99)) (< .cse1 .cse100) (= 0 (let ((.cse105 (* (mod |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125| 4294967296) 4)) (.cse107 (* (mod (+ |c_ULTIMATE.start_main_~pivot~0#1| |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4)) (.cse106 (* (mod (+ .cse20 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_101_104_125|) 4294967296) 4))) (let ((.cse103 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse105) (+ (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse107)) (select .cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse106))))))) (let ((.cse102 (let ((.cse104 (select .cse103 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (store .cse104 (+ .cse105 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (+ (select .cse104 (+ .cse106 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse104 (+ .cse107 |c_ULTIMATE.start_main_~#array2~0#1.offset|))))))) (let ((.cse101 (select (store .cse103 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse102) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (+ (select .cse101 .cse13) (select .cse101 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse102 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse101 .cse9) (select .cse102 .cse12) (select .cse102 .cse11) |c_ULTIMATE.start_main_~sum~0#1|)))))) (< .cse98 .cse21) (< .cse100 .cse59)))))))) (< 3 c_~ARR_SIZE~0) (not (< 0 c_~ARR_SIZE~0))) is different from true [2023-02-16 00:15:10,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:15:10,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973766412] [2023-02-16 00:15:10,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:15:10,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538504838] [2023-02-16 00:15:10,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538504838] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:15:10,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:15:10,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2023-02-16 00:15:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037979828] [2023-02-16 00:15:10,397 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-16 00:15:10,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 00:15:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:15:10,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 00:15:10,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1070, Unknown=5, NotChecked=68, Total=1332 [2023-02-16 00:15:10,400 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 23 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-16 00:15:17,291 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-16 00:15:19,316 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]