./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/modn.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/modn.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 b1b107a3e17c36933ddc5a5cff6ab95f9f0d71df794eec32ec4a28d109efd829 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:07:42,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:07:42,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:07:43,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:07:43,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:07:43,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:07:43,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:07:43,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:07:43,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:07:43,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:07:43,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:07:43,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:07:43,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:07:43,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:07:43,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:07:43,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:07:43,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:07:43,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:07:43,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:07:43,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:07:43,055 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:07:43,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:07:43,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:07:43,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:07:43,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:07:43,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:07:43,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:07:43,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:07:43,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:07:43,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:07:43,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:07:43,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:07:43,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:07:43,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:07:43,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:07:43,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:07:43,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:07:43,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:07:43,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:07:43,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:07:43,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:07:43,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:07:43,072 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:07:43,095 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:07:43,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:07:43,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:07:43,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:07:43,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:07:43,096 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:07:43,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:07:43,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:07:43,097 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:07:43,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:07:43,098 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:07:43,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:07:43,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:07:43,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:07:43,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:07:43,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:07:43,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:07:43,099 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:07:43,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:07:43,100 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:07:43,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:07:43,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:07:43,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:07:43,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:07:43,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:07:43,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:07:43,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:07:43,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:07:43,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:07:43,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:07:43,102 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:07:43,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:07:43,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:07:43,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1b107a3e17c36933ddc5a5cff6ab95f9f0d71df794eec32ec4a28d109efd829 [2022-07-20 22:07:43,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:07:43,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:07:43,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:07:43,314 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:07:43,315 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:07:43,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/modn.c [2022-07-20 22:07:43,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7e803a2/5c589d40d98f47dd96e3bd7acc916472/FLAG22097c998 [2022-07-20 22:07:43,696 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:07:43,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/modn.c [2022-07-20 22:07:43,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7e803a2/5c589d40d98f47dd96e3bd7acc916472/FLAG22097c998 [2022-07-20 22:07:44,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7e803a2/5c589d40d98f47dd96e3bd7acc916472 [2022-07-20 22:07:44,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:07:44,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:07:44,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:07:44,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:07:44,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:07:44,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cf242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44, skipping insertion in model container [2022-07-20 22:07:44,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:07:44,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:07:44,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/modn.c[587,600] [2022-07-20 22:07:44,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:07:44,325 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:07:44,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/modn.c[587,600] [2022-07-20 22:07:44,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:07:44,361 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:07:44,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44 WrapperNode [2022-07-20 22:07:44,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:07:44,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:07:44,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:07:44,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:07:44,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,390 INFO L137 Inliner]: procedures = 17, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2022-07-20 22:07:44,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:07:44,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:07:44,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:07:44,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:07:44,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:07:44,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:07:44,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:07:44,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:07:44,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (1/1) ... [2022-07-20 22:07:44,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:07:44,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:07:44,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 22:07:44,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 22:07:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:07:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:07:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 22:07:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 22:07:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:07:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:07:44,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:07:44,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 22:07:44,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 22:07:44,512 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:07:44,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:07:44,647 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:07:44,660 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:07:44,661 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 22:07:44,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:07:44 BoogieIcfgContainer [2022-07-20 22:07:44,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:07:44,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:07:44,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:07:44,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:07:44,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:07:44" (1/3) ... [2022-07-20 22:07:44,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee9fcd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:07:44, skipping insertion in model container [2022-07-20 22:07:44,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:07:44" (2/3) ... [2022-07-20 22:07:44,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee9fcd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:07:44, skipping insertion in model container [2022-07-20 22:07:44,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:07:44" (3/3) ... [2022-07-20 22:07:44,679 INFO L111 eAbstractionObserver]: Analyzing ICFG modn.c [2022-07-20 22:07:44,688 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:07:44,688 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:07:44,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:07:44,725 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@710ad6dc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@753ac5e4 [2022-07-20 22:07:44,726 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:07:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 22:07:44,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:07:44,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:07:44,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:07:44,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:07:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2022-07-20 22:07:44,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:07:44,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078291913] [2022-07-20 22:07:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:07:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:07:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:07:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:07:44,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:07:44,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078291913] [2022-07-20 22:07:44,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078291913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:07:44,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:07:44,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 22:07:44,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146043811] [2022-07-20 22:07:44,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:07:44,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 22:07:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:07:44,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 22:07:44,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 22:07:44,886 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:07:44,899 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-07-20 22:07:44,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 22:07:44,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 22:07:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:07:44,906 INFO L225 Difference]: With dead ends: 38 [2022-07-20 22:07:44,906 INFO L226 Difference]: Without dead ends: 17 [2022-07-20 22:07:44,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 22:07:44,914 INFO L413 NwaCegarLoop]: 24 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, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:07:44,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:07:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-20 22:07:44,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-20 22:07:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-20 22:07:44,936 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-07-20 22:07:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:07:44,937 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-20 22:07:44,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-20 22:07:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 22:07:44,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:07:44,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:07:44,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:07:44,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:07:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:07:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2022-07-20 22:07:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:07:44,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592519732] [2022-07-20 22:07:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:07:44,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:07:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:07:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:07:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:07:45,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592519732] [2022-07-20 22:07:45,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592519732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:07:45,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:07:45,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:07:45,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311090132] [2022-07-20 22:07:45,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:07:45,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:07:45,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:07:45,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:07:45,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:07:45,049 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:45,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:07:45,096 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-20 22:07:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:07:45,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 22:07:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:07:45,099 INFO L225 Difference]: With dead ends: 37 [2022-07-20 22:07:45,099 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 22:07:45,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:07:45,110 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:07:45,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:07:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 22:07:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-07-20 22:07:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-20 22:07:45,121 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-07-20 22:07:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:07:45,122 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-20 22:07:45,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-20 22:07:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 22:07:45,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:07:45,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:07:45,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:07:45,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:07:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:07:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2022-07-20 22:07:45,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:07:45,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577868466] [2022-07-20 22:07:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:07:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:07:45,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:07:45,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899324429] [2022-07-20 22:07:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:07:45,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:07:45,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:07:45,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:07:45,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 22:07:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:07:45,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 22:07:45,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:07:45,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:07:45,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-20 22:07:45,430 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-20 22:07:45,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2022-07-20 22:07:45,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-20 22:07:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:07:45,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:07:47,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_~N~0 0)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (= (mod .cse5 c_~N~0) 0)) (.cse1 (< .cse5 0)) (.cse4 (not .cse3))) (and (or (and (not .cse0) .cse1) (let ((.cse2 (forall ((|ULTIMATE.start_main_~a~0#1.base| Int)) (= (select (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (or .cse2 .cse3) (or .cse4 .cse2)))) (or .cse0 (not .cse1) (and (or (forall ((|ULTIMATE.start_main_~a~0#1.base| Int)) (= (select (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse3) (or (forall ((|ULTIMATE.start_main_~a~0#1.base| Int)) (= (select (store (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse4)))))) is different from false [2022-07-20 22:07:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 22:07:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:07:55,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577868466] [2022-07-20 22:07:55,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:07:55,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899324429] [2022-07-20 22:07:55,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899324429] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:07:55,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:07:55,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-20 22:07:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661346161] [2022-07-20 22:07:55,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:07:55,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 22:07:55,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:07:55,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 22:07:55,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=233, Unknown=3, NotChecked=32, Total=342 [2022-07-20 22:07:55,534 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:07:56,515 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-07-20 22:07:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 22:07:56,516 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 22:07:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:07:56,516 INFO L225 Difference]: With dead ends: 36 [2022-07-20 22:07:56,516 INFO L226 Difference]: Without dead ends: 34 [2022-07-20 22:07:56,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=135, Invalid=372, Unknown=3, NotChecked=42, Total=552 [2022-07-20 22:07:56,518 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:07:56,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 69 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 79 Invalid, 0 Unknown, 58 Unchecked, 0.4s Time] [2022-07-20 22:07:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-20 22:07:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-07-20 22:07:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-20 22:07:56,524 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2022-07-20 22:07:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:07:56,524 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-20 22:07:56,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-20 22:07:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 22:07:56,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:07:56,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:07:56,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 22:07:56,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:07:56,727 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:07:56,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:07:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1267903976, now seen corresponding path program 2 times [2022-07-20 22:07:56,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:07:56,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60115493] [2022-07-20 22:07:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:07:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:07:56,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:07:56,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396569795] [2022-07-20 22:07:56,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:07:56,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:07:56,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:07:56,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:07:56,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 22:07:56,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:07:56,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:07:56,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:07:56,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:07:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:07:57,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:07:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:07:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:07:57,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60115493] [2022-07-20 22:07:57,265 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:07:57,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396569795] [2022-07-20 22:07:57,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396569795] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:07:57,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:07:57,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-20 22:07:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743772980] [2022-07-20 22:07:57,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:07:57,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:07:57,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:07:57,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:07:57,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:07:57,266 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:07:57,778 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-20 22:07:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:07:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 22:07:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:07:57,791 INFO L225 Difference]: With dead ends: 61 [2022-07-20 22:07:57,791 INFO L226 Difference]: Without dead ends: 42 [2022-07-20 22:07:57,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:07:57,792 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:07:57,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 45 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 22:07:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-20 22:07:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2022-07-20 22:07:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-20 22:07:57,795 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-07-20 22:07:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:07:57,795 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-20 22:07:57,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:07:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-20 22:07:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 22:07:57,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:07:57,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:07:57,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 22:07:58,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-20 22:07:58,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:07:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:07:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1174519208, now seen corresponding path program 3 times [2022-07-20 22:07:58,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:07:58,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032554468] [2022-07-20 22:07:58,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:07:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:07:58,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:07:58,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788924577] [2022-07-20 22:07:58,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:07:58,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:07:58,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:07:58,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:07:58,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 22:07:58,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-20 22:07:58,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:07:58,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 22:07:58,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:07:58,879 INFO L356 Elim1Store]: treesize reduction 40, result has 56.0 percent of original size [2022-07-20 22:07:58,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 96 [2022-07-20 22:08:16,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-20 22:08:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 22:08:16,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:08:17,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:08:17,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 107 [2022-07-20 22:08:17,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2022-07-20 22:08:17,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-07-20 22:08:17,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-07-20 22:08:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 22:08:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:08:18,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032554468] [2022-07-20 22:08:18,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:08:18,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788924577] [2022-07-20 22:08:18,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788924577] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:08:18,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:08:18,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2022-07-20 22:08:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292495803] [2022-07-20 22:08:18,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:08:18,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 22:08:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:08:18,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 22:08:18,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-07-20 22:08:18,652 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:08:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:08:18,975 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-07-20 22:08:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 22:08:18,976 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 22:08:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:08:18,976 INFO L225 Difference]: With dead ends: 29 [2022-07-20 22:08:18,976 INFO L226 Difference]: Without dead ends: 24 [2022-07-20 22:08:18,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:08:18,977 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:08:18,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 60 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 34 Unchecked, 0.2s Time] [2022-07-20 22:08:18,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-20 22:08:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-07-20 22:08:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:08:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-07-20 22:08:18,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2022-07-20 22:08:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:08:18,980 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-20 22:08:18,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:08:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-07-20 22:08:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 22:08:18,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:08:18,981 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:08:18,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 22:08:19,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:08:19,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:08:19,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:08:19,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1786143722, now seen corresponding path program 4 times [2022-07-20 22:08:19,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:08:19,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550354757] [2022-07-20 22:08:19,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:08:19,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:08:19,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:08:19,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207058614] [2022-07-20 22:08:19,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:08:19,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:08:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:08:19,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:08:19,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 22:08:19,283 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:08:19,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:08:19,284 WARN L261 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-20 22:08:19,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:08:19,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:08:19,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 22:08:19,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 22:08:20,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:20,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-20 22:08:20,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:20,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:20,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 22:08:21,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:08:21,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 25 [2022-07-20 22:08:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:08:21,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:08:23,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)))) is different from false [2022-07-20 22:08:48,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_44|)) (let ((.cse0 (forall ((v_ArrVal_135 Int)) (= (select (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (+ (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (mod .cse4 ~N~0)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (.cse1 (< ~N~0 0))) (and (or .cse0 (not .cse1)) (let ((.cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (or (= (mod .cse2 ~N~0) 0) (not (< .cse2 0)))) (or .cse0 .cse1))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-20 22:09:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 22:09:02,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:09:02,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550354757] [2022-07-20 22:09:02,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:09:02,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207058614] [2022-07-20 22:09:02,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207058614] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:09:02,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:09:02,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-20 22:09:02,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882974169] [2022-07-20 22:09:02,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:09:02,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 22:09:02,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:09:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 22:09:02,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=382, Unknown=13, NotChecked=82, Total=552 [2022-07-20 22:09:02,361 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:09:12,820 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 55 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 22:09:14,855 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)))) (exists ((~N~0 Int)) (and (< 1 ~N~0) (<= ~N~0 2) (= (mod 2 ~N~0) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-20 22:09:16,871 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_135) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_44|)))) (exists ((~N~0 Int)) (and (< 1 ~N~0) (<= ~N~0 2) (= (mod 2 ~N~0) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-20 22:09:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:09:17,231 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-07-20 22:09:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 22:09:17,231 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 22:09:17,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:09:17,232 INFO L225 Difference]: With dead ends: 49 [2022-07-20 22:09:17,232 INFO L226 Difference]: Without dead ends: 47 [2022-07-20 22:09:17,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=16, NotChecked=188, Total=756 [2022-07-20 22:09:17,233 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:09:17,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 121 Unchecked, 0.2s Time] [2022-07-20 22:09:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-20 22:09:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-07-20 22:09:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:09:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-07-20 22:09:17,238 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2022-07-20 22:09:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:09:17,238 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-07-20 22:09:17,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:09:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-07-20 22:09:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 22:09:17,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:09:17,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:09:17,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 22:09:17,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:09:17,447 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:09:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:09:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1232945932, now seen corresponding path program 1 times [2022-07-20 22:09:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:09:17,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513700228] [2022-07-20 22:09:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:09:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:09:17,458 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:09:17,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049987496] [2022-07-20 22:09:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:09:17,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:09:17,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:09:17,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:09:17,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 22:09:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:09:17,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-20 22:09:17,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:09:17,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:09:17,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:09:17,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-20 22:09:17,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-20 22:09:17,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2022-07-20 22:09:18,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:09:18,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2022-07-20 22:09:20,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2022-07-20 22:09:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:09:20,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:09:29,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_ArrVal_174 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse1 (mod v_ArrVal_174 ~N~0))) (or (= (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_174)))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) ~N~0) 0) (not (<= (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) v_ArrVal_174)) (not (= .cse1 0))))) is different from false [2022-07-20 22:09:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 22:09:32,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:09:32,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513700228] [2022-07-20 22:09:32,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:09:32,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049987496] [2022-07-20 22:09:32,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049987496] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:09:32,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:09:32,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2022-07-20 22:09:32,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466810120] [2022-07-20 22:09:32,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:09:32,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 22:09:32,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:09:32,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 22:09:32,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=451, Unknown=3, NotChecked=44, Total=600 [2022-07-20 22:09:32,267 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:09:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:09:33,471 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-07-20 22:09:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 22:09:33,472 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 22:09:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:09:33,472 INFO L225 Difference]: With dead ends: 71 [2022-07-20 22:09:33,473 INFO L226 Difference]: Without dead ends: 69 [2022-07-20 22:09:33,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=128, Invalid=575, Unknown=3, NotChecked=50, Total=756 [2022-07-20 22:09:33,474 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:09:33,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 124 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 69 Unchecked, 0.6s Time] [2022-07-20 22:09:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-20 22:09:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2022-07-20 22:09:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:09:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-07-20 22:09:33,497 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 24 [2022-07-20 22:09:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:09:33,497 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-07-20 22:09:33,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:09:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-07-20 22:09:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 22:09:33,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:09:33,498 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:09:33,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 22:09:33,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:09:33,717 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:09:33,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:09:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash -900609774, now seen corresponding path program 5 times [2022-07-20 22:09:33,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:09:33,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916448342] [2022-07-20 22:09:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:09:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:09:33,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:09:33,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302894007] [2022-07-20 22:09:33,731 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 22:09:33,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:09:33,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:09:33,732 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:09:33,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 22:09:33,788 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-20 22:09:33,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:09:33,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 22:09:33,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:09:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:09:34,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:09:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:09:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:09:34,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916448342] [2022-07-20 22:09:34,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:09:34,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302894007] [2022-07-20 22:09:34,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302894007] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:09:34,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:09:34,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-20 22:09:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898517525] [2022-07-20 22:09:34,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:09:34,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 22:09:34,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:09:34,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 22:09:34,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-07-20 22:09:34,729 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:09:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:09:35,915 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-07-20 22:09:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 22:09:35,928 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 22:09:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:09:35,928 INFO L225 Difference]: With dead ends: 123 [2022-07-20 22:09:35,928 INFO L226 Difference]: Without dead ends: 85 [2022-07-20 22:09:35,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-07-20 22:09:35,929 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 187 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:09:35,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 88 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 22:09:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-20 22:09:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 51. [2022-07-20 22:09:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:09:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-07-20 22:09:35,935 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 24 [2022-07-20 22:09:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:09:35,935 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-07-20 22:09:35,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:09:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-07-20 22:09:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 22:09:35,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:09:35,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:09:35,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 22:09:36,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:09:36,136 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:09:36,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:09:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1049585326, now seen corresponding path program 6 times [2022-07-20 22:09:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:09:36,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705871997] [2022-07-20 22:09:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:09:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:09:36,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:09:36,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1468719568] [2022-07-20 22:09:36,152 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 22:09:36,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:09:36,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:09:36,157 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:09:36,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 22:09:36,217 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-20 22:09:36,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:09:36,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-20 22:09:36,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:09:36,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:09:36,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:09:36,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 22:09:36,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 22:09:36,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 22:09:37,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-20 22:09:37,942 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-20 22:09:37,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2022-07-20 22:09:38,285 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-20 22:09:38,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2022-07-20 22:09:38,877 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 22:09:38,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 30 [2022-07-20 22:09:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:09:38,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:09:41,441 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~N~0 0)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (= (mod .cse5 c_~N~0) 0)) (.cse3 (< .cse5 0)) (.cse0 (not .cse1))) (and (or (and (or .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse1)) .cse2 (not .cse3)) (or (and (not .cse2) .cse3) (let ((.cse4 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (or .cse0 .cse4) (or .cse4 .cse1))))))) is different from false [2022-07-20 22:09:45,088 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (< c_~N~0 0)) (.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (= (mod .cse15 c_~N~0) 0)) (.cse1 (< .cse15 0)) (.cse8 (not .cse6))) (and (or (and (not .cse0) .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse3 c_~N~0) 0)) (< .cse3 0))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse4 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse5 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse4 0)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_3 Int)) (= (select (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse7 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse8))) (or .cse0 (not .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse9 c_~N~0) 0)) (< .cse9 0))) (forall ((v_subst_3 Int)) (= (select (let ((.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse10 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (< .cse11 0)) (forall ((v_subst_1 Int)) (= (select (let ((.cse13 (* (- 1) c_~N~0))) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse13)))) (store .cse12 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse13)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (mod .cse11 c_~N~0) 0))))) .cse6) (or .cse8 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_2 Int)) (= (select (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse14 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))) is different from false [2022-07-20 22:09:48,474 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse55 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (< c_~N~0 0)) (.cse27 (mod .cse55 c_~N~0))) (let ((.cse0 (= .cse27 0)) (.cse1 (< .cse55 0)) (.cse25 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (not .cse28))) (and (or (and (not .cse0) .cse1) (and (or (forall ((v_subst_7 Int) (v_subst_3 Int)) (= (select (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse3 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse4) (or (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse25 .cse26 .cse27)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (= (mod .cse24 c_~N~0) 0)) (.cse14 (< .cse24 0))) (and (or (and (forall ((v_subst_4 Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse5 (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse6 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))))) (store .cse5 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse8 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< .cse7 0) (not (= (mod .cse7 c_~N~0) 0)))))) (forall ((v_subst_5 Int)) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (forall ((v_subst_1 Int)) (= (select (let ((.cse10 (* (- 1) c_~N~0))) (let ((.cse9 (let ((.cse11 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse10))))) (store .cse9 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse10)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (mod .cse12 c_~N~0) 0) (not (< .cse12 0)))))) (not .cse14) .cse15) (or (and (not .cse15) .cse14) (and (forall ((v_subst_9 Int)) (or (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse17 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< .cse16 0) (not (= (mod .cse16 c_~N~0) 0)))) (forall ((v_subst_3 Int)) (= (select (let ((.cse18 (let ((.cse19 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse19 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse18 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_subst_8 Int)) (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse23 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse23 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse20 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse21 (let ((.cse22 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse22 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse21 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse20 0)))))))))) .cse28))) (or .cse0 (not .cse1) (and (or (let ((.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse25 .cse26 (+ .cse27 (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse29 (= (mod .cse52 c_~N~0) 0)) (.cse42 (< .cse52 0))) (and (or .cse29 (and (forall ((v_subst_4 Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse30 (let ((.cse32 (* (- 1) c_~N~0))) (let ((.cse31 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse32)))) (store .cse31 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse32)))))) (store .cse30 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (* (- 1) c_~N~0))) (let ((.cse34 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse35)))) (store .cse34 (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse35))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< .cse33 0) (not (= (mod .cse33 c_~N~0) 0)))))) (forall ((v_subst_5 Int)) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse41 (* (- 1) c_~N~0))) (let ((.cse40 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse41)))) (store .cse40 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse41))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse36 c_~N~0) 0) (not (< .cse36 0)) (forall ((v_subst_1 Int)) (= 0 (select (let ((.cse38 (* (- 1) c_~N~0))) (let ((.cse37 (let ((.cse39 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse38)))) (store .cse39 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse38))))) (store .cse37 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse38)))) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not .cse42)) (or (and (not .cse29) .cse42) (and (forall ((v_subst_8 Int)) (let ((.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse47 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (< .cse43 0)) (= (mod .cse43 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse45 (* (- 1) c_~N~0))) (let ((.cse44 (let ((.cse46 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse45)))) (store .cse46 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse44 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse45)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (forall ((v_subst_9 Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse48 (let ((.cse49 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse49 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse48 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse51 (+ (* 4 v_subst_9) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse50 c_~N~0) 0)) (< .cse50 0)))))))))) .cse28) (or (forall ((v_subst_6 Int) (v_subst_2 Int)) (= (select (let ((.cse53 (let ((.cse54 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse54 (+ (* 4 v_subst_6) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))))) (store .cse53 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse4))))))) is different from false [2022-07-20 22:09:55,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:09:55,657 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 22:09:55,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 1 [2022-07-20 22:09:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-20 22:09:55,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:09:55,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705871997] [2022-07-20 22:09:55,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:09:55,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468719568] [2022-07-20 22:09:55,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468719568] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:09:55,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:09:55,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2022-07-20 22:09:55,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690376781] [2022-07-20 22:09:55,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:09:55,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 22:09:55,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:09:55,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 22:09:55,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=537, Unknown=3, NotChecked=150, Total=812 [2022-07-20 22:09:55,665 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:10:03,781 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (< c_~N~0 0)) (.cse16 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (= (mod .cse16 c_~N~0) 0)) (.cse1 (< .cse16 0)) (.cse8 (not .cse6)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or (and (not .cse0) .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse3 c_~N~0) 0)) (< .cse3 0))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse4 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse5 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse4 0)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_3 Int)) (= (select (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse7 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse8))) (< 2 c_~N~0) (= (mod 3 c_~N~0) (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) (or .cse0 (not .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse10 c_~N~0) 0)) (< .cse10 0))) (forall ((v_subst_3 Int)) (= (select (let ((.cse11 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse11 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (< .cse12 0)) (forall ((v_subst_1 Int)) (= (select (let ((.cse14 (* (- 1) c_~N~0))) (let ((.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse14)))) (store .cse13 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse14)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (mod .cse12 c_~N~0) 0))))) .cse6) (or .cse8 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_2 Int)) (= (select (let ((.cse15 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse15 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse16 3) (= (select .cse9 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))) is different from false [2022-07-20 22:10:06,042 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (< c_~N~0 0)) (.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (= (mod .cse15 c_~N~0) 0)) (.cse1 (< .cse15 0)) (.cse8 (not .cse6))) (and (or (and (not .cse0) .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_subst_3 Int)) (= (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse2 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse3 c_~N~0) 0)) (< .cse3 0))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (= (mod .cse4 c_~N~0) 0) (forall ((v_subst_1 Int)) (= (select (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse5 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse4 0)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_3 Int)) (= (select (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) (store .cse7 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse8))) (< 2 c_~N~0) (= (mod 3 c_~N~0) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (or .cse0 (not .cse1) (and (or (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (not (= (mod .cse9 c_~N~0) 0)) (< .cse9 0))) (forall ((v_subst_3 Int)) (= (select (let ((.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))))) (store .cse10 (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0)))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (< .cse11 0)) (forall ((v_subst_1 Int)) (= (select (let ((.cse13 (* (- 1) c_~N~0))) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse13)))) (store .cse12 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) .cse13)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (mod .cse11 c_~N~0) 0))))) .cse6) (or .cse8 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_subst_2 Int)) (= (select (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))))) (store .cse14 (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse15 3)))) is different from false [2022-07-20 22:10:08,523 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~N~0 0)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (= (mod .cse0 c_~N~0) 0)) (.cse4 (< .cse0 0)) (.cse1 (not .cse2))) (and (< 2 c_~N~0) (= (mod 3 c_~N~0) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse0 3) (or (and (or .cse1 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (* (- 1) c_~N~0))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse2)) .cse3 (not .cse4)) (or (and (not .cse3) .cse4) (let ((.cse5 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (mod (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (or .cse1 .cse5) (or .cse5 .cse2))))))) is different from false [2022-07-20 22:10:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:10:08,765 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-07-20 22:10:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 22:10:08,766 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 22:10:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:10:08,766 INFO L225 Difference]: With dead ends: 73 [2022-07-20 22:10:08,766 INFO L226 Difference]: Without dead ends: 71 [2022-07-20 22:10:08,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=160, Invalid=728, Unknown=6, NotChecked=366, Total=1260 [2022-07-20 22:10:08,767 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:10:08,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 85 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 139 Unchecked, 0.3s Time] [2022-07-20 22:10:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-20 22:10:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2022-07-20 22:10:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:10:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-07-20 22:10:08,777 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 24 [2022-07-20 22:10:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:10:08,778 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-07-20 22:10:08,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:10:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-07-20 22:10:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 22:10:08,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:10:08,779 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:10:08,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-20 22:10:08,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:10:08,984 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:10:08,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:10:08,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1501136494, now seen corresponding path program 7 times [2022-07-20 22:10:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:10:08,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963100963] [2022-07-20 22:10:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:10:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:10:09,005 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:10:09,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893478313] [2022-07-20 22:10:09,022 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 22:10:09,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:10:09,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:10:09,023 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:10:09,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 22:10:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:10:09,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 22:10:09,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:10:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:10:09,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:10:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:10:09,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:10:09,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963100963] [2022-07-20 22:10:09,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:10:09,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893478313] [2022-07-20 22:10:09,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893478313] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:10:09,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:10:09,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-20 22:10:09,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029573166] [2022-07-20 22:10:09,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:10:09,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 22:10:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:10:09,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 22:10:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-07-20 22:10:09,938 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:10:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:10:11,517 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-07-20 22:10:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 22:10:11,517 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 22:10:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:10:11,518 INFO L225 Difference]: With dead ends: 100 [2022-07-20 22:10:11,518 INFO L226 Difference]: Without dead ends: 83 [2022-07-20 22:10:11,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-07-20 22:10:11,519 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 110 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:10:11,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 111 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 22:10:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-20 22:10:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2022-07-20 22:10:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:10:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-07-20 22:10:11,536 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 24 [2022-07-20 22:10:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:10:11,537 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-20 22:10:11,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:10:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-07-20 22:10:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 22:10:11,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:10:11,539 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:10:11,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 22:10:11,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-20 22:10:11,758 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:10:11,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:10:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash 778799246, now seen corresponding path program 8 times [2022-07-20 22:10:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:10:11,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946119193] [2022-07-20 22:10:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:10:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:10:11,769 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 22:10:11,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250030400] [2022-07-20 22:10:11,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:10:11,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:10:11,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:10:11,799 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:10:11,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 22:10:11,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:10:11,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:10:11,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 22:10:11,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:10:11,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:10:12,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:10:12,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 22:10:12,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-20 22:10:12,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 22:10:13,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-20 22:10:13,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-20 22:10:14,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:10:14,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 22:10:14,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:10:14,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 22:10:14,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:10:14,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-20 22:10:15,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 25 [2022-07-20 22:10:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:10:15,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:10:17,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_109|)) (forall ((v_ArrVal_372 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_109| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_372) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-07-20 22:10:20,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_110|)) (forall ((v_ArrVal_372 Int) (v_ArrVal_370 Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_110| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_109| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_372) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))))) is different from false [2022-07-20 22:10:22,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int) (v_ArrVal_372 Int) (v_ArrVal_370 Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int) (v_ArrVal_369 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_110|)) (= 0 (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_369) (+ (* |v_ULTIMATE.start_main_~i~0#1_110| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_109| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_372) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))) is different from false [2022-07-20 22:10:24,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_111|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int) (v_ArrVal_372 Int) (v_ArrVal_370 Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int) (v_ArrVal_369 Int)) (or (= 0 (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_111| 4)) v_ArrVal_369) (+ (* |v_ULTIMATE.start_main_~i~0#1_110| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_109| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_372) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_111| 1) |v_ULTIMATE.start_main_~i~0#1_110|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))))) is different from false [2022-07-20 22:11:24,252 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 22:11:24,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 1 [2022-07-20 22:11:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-20 22:11:24,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:11:24,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946119193] [2022-07-20 22:11:24,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 22:11:24,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250030400] [2022-07-20 22:11:24,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250030400] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:11:24,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:11:24,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-07-20 22:11:24,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086037528] [2022-07-20 22:11:24,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:11:24,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 22:11:24,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:11:24,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 22:11:24,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1068, Unknown=20, NotChecked=284, Total=1560 [2022-07-20 22:11:24,260 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 40 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:12:00,823 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((~N~0 Int)) (and (<= ~N~0 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod 4 ~N~0)) (< 3 ~N~0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_111|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int) (v_ArrVal_372 Int) (v_ArrVal_370 Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int) (v_ArrVal_369 Int)) (or (= 0 (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_111| 4)) v_ArrVal_369) (+ (* |v_ULTIMATE.start_main_~i~0#1_110| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_109| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_372) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_111| 1) |v_ULTIMATE.start_main_~i~0#1_110|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 4))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-20 22:12:21,865 WARN L233 SmtUtils]: Spent 16.09s on a formula simplification. DAG size of input: 53 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)