./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Primes.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 15:46:21,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 15:46:21,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 15:46:21,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 15:46:21,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 15:46:21,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 15:46:21,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 15:46:21,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 15:46:21,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 15:46:21,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 15:46:21,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 15:46:21,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 15:46:21,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 15:46:21,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 15:46:21,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 15:46:21,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 15:46:21,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 15:46:21,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 15:46:21,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 15:46:21,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 15:46:21,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 15:46:21,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 15:46:21,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 15:46:21,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 15:46:21,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 15:46:21,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 15:46:21,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 15:46:21,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 15:46:21,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 15:46:21,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 15:46:21,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 15:46:21,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 15:46:21,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 15:46:21,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 15:46:21,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 15:46:21,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 15:46:21,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 15:46:21,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 15:46:21,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 15:46:21,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 15:46:21,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 15:46:21,271 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/config/svcomp-Overflow-32bit-Taipan_Default.epf [2021-11-19 15:46:21,316 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 15:46:21,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 15:46:21,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 15:46:21,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 15:46:21,319 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 15:46:21,319 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 15:46:21,320 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 15:46:21,320 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 15:46:21,320 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 15:46:21,321 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 15:46:21,321 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 15:46:21,321 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 15:46:21,322 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 15:46:21,322 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 15:46:21,323 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 15:46:21,323 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 15:46:21,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 15:46:21,324 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 15:46:21,325 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 15:46:21,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 15:46:21,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 15:46:21,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 15:46:21,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 15:46:21,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 15:46:21,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 15:46:21,327 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-19 15:46:21,327 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 15:46:21,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 15:46:21,327 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 15:46:21,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 15:46:21,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 15:46:21,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 15:46:21,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 15:46:21,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 15:46:21,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 15:46:21,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 15:46:21,330 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 15:46:21,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 15:46:21,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 15:46:21,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 15:46:21,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 15:46:21,331 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2021-11-19 15:46:21,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 15:46:21,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 15:46:21,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 15:46:21,675 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 15:46:21,676 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 15:46:21,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/recursive/Primes.c [2021-11-19 15:46:21,773 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/data/eb130cbef/88e6acdbe8ac4c3fac61490815294630/FLAGf0474bf59 [2021-11-19 15:46:22,361 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 15:46:22,362 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/sv-benchmarks/c/recursive/Primes.c [2021-11-19 15:46:22,370 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/data/eb130cbef/88e6acdbe8ac4c3fac61490815294630/FLAGf0474bf59 [2021-11-19 15:46:22,741 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/data/eb130cbef/88e6acdbe8ac4c3fac61490815294630 [2021-11-19 15:46:22,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 15:46:22,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 15:46:22,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 15:46:22,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 15:46:22,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 15:46:22,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:46:22" (1/1) ... [2021-11-19 15:46:22,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428f196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:22, skipping insertion in model container [2021-11-19 15:46:22,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:46:22" (1/1) ... [2021-11-19 15:46:22,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 15:46:22,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 15:46:23,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2021-11-19 15:46:23,023 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 15:46:23,034 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 15:46:23,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2021-11-19 15:46:23,062 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 15:46:23,080 INFO L208 MainTranslator]: Completed translation [2021-11-19 15:46:23,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23 WrapperNode [2021-11-19 15:46:23,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 15:46:23,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 15:46:23,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 15:46:23,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 15:46:23,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (1/1) ... [2021-11-19 15:46:23,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (1/1) ... [2021-11-19 15:46:23,128 INFO L137 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2021-11-19 15:46:23,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 15:46:23,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 15:46:23,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 15:46:23,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 15:46:23,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (1/1) ... [2021-11-19 15:46:23,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (1/1) ... [2021-11-19 15:46:23,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (1/1) ... [2021-11-19 15:46:23,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (1/1) ... [2021-11-19 15:46:23,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (1/1) ... [2021-11-19 15:46:23,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (1/1) ... [2021-11-19 15:46:23,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (1/1) ... [2021-11-19 15:46:23,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 15:46:23,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 15:46:23,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 15:46:23,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 15:46:23,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (1/1) ... [2021-11-19 15:46:23,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 15:46:23,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:23,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 15:46:23,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 15:46:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2021-11-19 15:46:23,273 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2021-11-19 15:46:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 15:46:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2021-11-19 15:46:23,273 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2021-11-19 15:46:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2021-11-19 15:46:23,274 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2021-11-19 15:46:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 15:46:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 15:46:23,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 15:46:23,376 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 15:46:23,379 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 15:46:23,738 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 15:46:23,798 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 15:46:23,798 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 15:46:23,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:46:23 BoogieIcfgContainer [2021-11-19 15:46:23,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 15:46:23,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 15:46:23,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 15:46:23,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 15:46:23,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 03:46:22" (1/3) ... [2021-11-19 15:46:23,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b7d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:46:23, skipping insertion in model container [2021-11-19 15:46:23,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:46:23" (2/3) ... [2021-11-19 15:46:23,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b7d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:46:23, skipping insertion in model container [2021-11-19 15:46:23,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:46:23" (3/3) ... [2021-11-19 15:46:23,821 INFO L111 eAbstractionObserver]: Analyzing ICFG Primes.c [2021-11-19 15:46:23,834 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 15:46:23,834 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-11-19 15:46:23,916 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 15:46:23,924 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-19 15:46:23,925 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-11-19 15:46:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.64) internal successors, (82), 66 states have internal predecessors, (82), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-19 15:46:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-19 15:46:23,951 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:23,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-19 15:46:23,953 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash 185888, now seen corresponding path program 1 times [2021-11-19 15:46:23,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:23,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611695158] [2021-11-19 15:46:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:23,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:24,178 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:24,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611695158] [2021-11-19 15:46:24,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611695158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:24,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:24,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 15:46:24,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129834259] [2021-11-19 15:46:24,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:24,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 15:46:24,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:24,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 15:46:24,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 15:46:24,238 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.64) internal successors, (82), 66 states have internal predecessors, (82), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-11-19 15:46:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:24,375 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2021-11-19 15:46:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 15:46:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-11-19 15:46:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:24,393 INFO L225 Difference]: With dead ends: 81 [2021-11-19 15:46:24,393 INFO L226 Difference]: Without dead ends: 74 [2021-11-19 15:46:24,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 15:46:24,402 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:24,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 174 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-19 15:46:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-11-19 15:46:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.574468085106383) internal successors, (74), 62 states have internal predecessors, (74), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-19 15:46:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2021-11-19 15:46:24,459 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 3 [2021-11-19 15:46:24,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:24,459 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2021-11-19 15:46:24,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-11-19 15:46:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2021-11-19 15:46:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-19 15:46:24,460 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:24,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-19 15:46:24,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 15:46:24,461 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:24,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash 5762635, now seen corresponding path program 1 times [2021-11-19 15:46:24,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:24,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975259743] [2021-11-19 15:46:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:24,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:24,531 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:24,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975259743] [2021-11-19 15:46:24,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975259743] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:24,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:24,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 15:46:24,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651684199] [2021-11-19 15:46:24,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:24,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 15:46:24,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:24,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 15:46:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 15:46:24,539 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2021-11-19 15:46:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:24,591 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2021-11-19 15:46:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 15:46:24,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-11-19 15:46:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:24,594 INFO L225 Difference]: With dead ends: 74 [2021-11-19 15:46:24,597 INFO L226 Difference]: Without dead ends: 73 [2021-11-19 15:46:24,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 15:46:24,603 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:24,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 167 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:46:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-19 15:46:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-11-19 15:46:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.553191489361702) internal successors, (73), 61 states have internal predecessors, (73), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-19 15:46:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2021-11-19 15:46:24,620 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 4 [2021-11-19 15:46:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:24,620 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2021-11-19 15:46:24,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2021-11-19 15:46:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2021-11-19 15:46:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-19 15:46:24,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:24,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:24,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 15:46:24,623 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:24,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:24,624 INFO L85 PathProgramCache]: Analyzing trace with hash -467491885, now seen corresponding path program 1 times [2021-11-19 15:46:24,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:24,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048360885] [2021-11-19 15:46:24,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:24,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:24,733 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:24,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048360885] [2021-11-19 15:46:24,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048360885] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:24,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:24,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 15:46:24,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335762246] [2021-11-19 15:46:24,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:24,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 15:46:24,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:24,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 15:46:24,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 15:46:24,737 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:24,859 INFO L93 Difference]: Finished difference Result 136 states and 175 transitions. [2021-11-19 15:46:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 15:46:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-19 15:46:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:24,863 INFO L225 Difference]: With dead ends: 136 [2021-11-19 15:46:24,863 INFO L226 Difference]: Without dead ends: 68 [2021-11-19 15:46:24,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:46:24,867 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:24,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 233 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-19 15:46:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2021-11-19 15:46:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-19 15:46:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2021-11-19 15:46:24,902 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 14 [2021-11-19 15:46:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:24,902 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2021-11-19 15:46:24,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2021-11-19 15:46:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 15:46:24,904 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:24,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:24,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 15:46:24,905 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:24,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1607339527, now seen corresponding path program 1 times [2021-11-19 15:46:24,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:24,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29238547] [2021-11-19 15:46:24,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:24,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:24,999 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:24,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29238547] [2021-11-19 15:46:25,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29238547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:25,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:25,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 15:46:25,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549992619] [2021-11-19 15:46:25,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:25,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 15:46:25,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:25,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 15:46:25,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 15:46:25,002 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:25,201 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2021-11-19 15:46:25,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 15:46:25,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-19 15:46:25,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:25,217 INFO L225 Difference]: With dead ends: 142 [2021-11-19 15:46:25,217 INFO L226 Difference]: Without dead ends: 81 [2021-11-19 15:46:25,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:46:25,221 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 31 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:25,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 260 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-19 15:46:25,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2021-11-19 15:46:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 64 states have internal predecessors, (76), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-19 15:46:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2021-11-19 15:46:25,245 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 15 [2021-11-19 15:46:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:25,246 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2021-11-19 15:46:25,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2021-11-19 15:46:25,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-19 15:46:25,247 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:25,247 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:25,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-19 15:46:25,248 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:25,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 665532417, now seen corresponding path program 1 times [2021-11-19 15:46:25,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:25,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790799412] [2021-11-19 15:46:25,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:25,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:25,398 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:25,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790799412] [2021-11-19 15:46:25,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790799412] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:25,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:25,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-19 15:46:25,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842940649] [2021-11-19 15:46:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:25,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 15:46:25,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:25,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 15:46:25,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:46:25,403 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:46:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:25,488 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2021-11-19 15:46:25,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 15:46:25,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-11-19 15:46:25,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:25,491 INFO L225 Difference]: With dead ends: 106 [2021-11-19 15:46:25,491 INFO L226 Difference]: Without dead ends: 79 [2021-11-19 15:46:25,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-19 15:46:25,495 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:25,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 378 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-19 15:46:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-11-19 15:46:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 66 states have internal predecessors, (77), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2021-11-19 15:46:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2021-11-19 15:46:25,512 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 17 [2021-11-19 15:46:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:25,512 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2021-11-19 15:46:25,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:46:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2021-11-19 15:46:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-19 15:46:25,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:25,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:25,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-19 15:46:25,514 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1535160157, now seen corresponding path program 1 times [2021-11-19 15:46:25,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:25,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699353632] [2021-11-19 15:46:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:25,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:25,632 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:25,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699353632] [2021-11-19 15:46:25,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699353632] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:25,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:25,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 15:46:25,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498422493] [2021-11-19 15:46:25,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:25,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 15:46:25,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:25,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 15:46:25,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:46:25,636 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:25,854 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2021-11-19 15:46:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 15:46:25,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-19 15:46:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:25,858 INFO L225 Difference]: With dead ends: 109 [2021-11-19 15:46:25,862 INFO L226 Difference]: Without dead ends: 106 [2021-11-19 15:46:25,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-19 15:46:25,866 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:25,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 294 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-11-19 15:46:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2021-11-19 15:46:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 84 states have internal predecessors, (101), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-11-19 15:46:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2021-11-19 15:46:25,909 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 17 [2021-11-19 15:46:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:25,910 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2021-11-19 15:46:25,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2021-11-19 15:46:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-19 15:46:25,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:25,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:25,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-19 15:46:25,912 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1355807845, now seen corresponding path program 1 times [2021-11-19 15:46:25,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:25,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825884290] [2021-11-19 15:46:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:25,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:25,974 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:25,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825884290] [2021-11-19 15:46:25,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825884290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:25,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:25,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 15:46:25,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012974157] [2021-11-19 15:46:25,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:25,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 15:46:25,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:25,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 15:46:25,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 15:46:25,976 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:46:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:26,049 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions. [2021-11-19 15:46:26,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 15:46:26,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-11-19 15:46:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:26,052 INFO L225 Difference]: With dead ends: 141 [2021-11-19 15:46:26,053 INFO L226 Difference]: Without dead ends: 117 [2021-11-19 15:46:26,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:46:26,055 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 28 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:26,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 285 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:46:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-19 15:46:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2021-11-19 15:46:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 92 states have internal predecessors, (112), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-19 15:46:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2021-11-19 15:46:26,076 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 18 [2021-11-19 15:46:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:26,076 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2021-11-19 15:46:26,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:46:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2021-11-19 15:46:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-19 15:46:26,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:26,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:26,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-19 15:46:26,078 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 345324673, now seen corresponding path program 1 times [2021-11-19 15:46:26,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:26,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095082814] [2021-11-19 15:46:26,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:26,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:26,152 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:26,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095082814] [2021-11-19 15:46:26,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095082814] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:26,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:26,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 15:46:26,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391220838] [2021-11-19 15:46:26,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:26,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 15:46:26,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:26,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 15:46:26,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:46:26,158 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:26,325 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2021-11-19 15:46:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 15:46:26,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-19 15:46:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:26,331 INFO L225 Difference]: With dead ends: 114 [2021-11-19 15:46:26,332 INFO L226 Difference]: Without dead ends: 113 [2021-11-19 15:46:26,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-19 15:46:26,334 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 42 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:26,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 263 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-19 15:46:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-11-19 15:46:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 92 states have internal predecessors, (110), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-19 15:46:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2021-11-19 15:46:26,352 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 18 [2021-11-19 15:46:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:26,353 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2021-11-19 15:46:26,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2021-11-19 15:46:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-19 15:46:26,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:26,355 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:26,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-19 15:46:26,355 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:26,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:26,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1556028481, now seen corresponding path program 1 times [2021-11-19 15:46:26,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:26,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172445280] [2021-11-19 15:46:26,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:26,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:26,437 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:26,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172445280] [2021-11-19 15:46:26,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172445280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:26,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:26,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 15:46:26,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121537243] [2021-11-19 15:46:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:26,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 15:46:26,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:26,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 15:46:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 15:46:26,440 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:46:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:26,555 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2021-11-19 15:46:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 15:46:26,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-11-19 15:46:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:26,558 INFO L225 Difference]: With dead ends: 135 [2021-11-19 15:46:26,560 INFO L226 Difference]: Without dead ends: 133 [2021-11-19 15:46:26,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:46:26,562 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 41 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:26,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 254 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-19 15:46:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2021-11-19 15:46:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 104 states have internal predecessors, (128), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-19 15:46:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2021-11-19 15:46:26,609 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 20 [2021-11-19 15:46:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:26,610 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2021-11-19 15:46:26,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:46:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2021-11-19 15:46:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 15:46:26,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:26,618 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:26,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-19 15:46:26,619 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:26,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash -921459591, now seen corresponding path program 1 times [2021-11-19 15:46:26,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:26,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393450570] [2021-11-19 15:46:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:26,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:26,762 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:26,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393450570] [2021-11-19 15:46:26,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393450570] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:26,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192094475] [2021-11-19 15:46:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:26,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:26,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:26,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:26,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 15:46:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:26,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-19 15:46:26,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:27,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:27,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192094475] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:46:27,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1681044671] [2021-11-19 15:46:27,296 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-19 15:46:27,296 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:27,302 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:27,304 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:46:27,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-11-19 15:46:27,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147086195] [2021-11-19 15:46:27,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:27,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-19 15:46:27,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:27,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-19 15:46:27,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-19 15:46:27,307 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:27,594 INFO L93 Difference]: Finished difference Result 249 states and 311 transitions. [2021-11-19 15:46:27,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 15:46:27,595 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-19 15:46:27,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:27,603 INFO L225 Difference]: With dead ends: 249 [2021-11-19 15:46:27,603 INFO L226 Difference]: Without dead ends: 141 [2021-11-19 15:46:27,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-11-19 15:46:27,606 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 118 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:27,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 436 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 15:46:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-19 15:46:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2021-11-19 15:46:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 113 states have internal predecessors, (139), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-19 15:46:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2021-11-19 15:46:27,643 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 23 [2021-11-19 15:46:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:27,644 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2021-11-19 15:46:27,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2021-11-19 15:46:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 15:46:27,647 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:27,647 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:27,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:27,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-19 15:46:27,862 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:27,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash 200055403, now seen corresponding path program 1 times [2021-11-19 15:46:27,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:27,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697170278] [2021-11-19 15:46:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:27,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:27,942 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:27,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697170278] [2021-11-19 15:46:27,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697170278] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:46:27,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:46:27,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 15:46:27,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181575459] [2021-11-19 15:46:27,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:27,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 15:46:27,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 15:46:27,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-19 15:46:27,944 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:46:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:28,036 INFO L93 Difference]: Finished difference Result 164 states and 205 transitions. [2021-11-19 15:46:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 15:46:28,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-11-19 15:46:28,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:28,041 INFO L225 Difference]: With dead ends: 164 [2021-11-19 15:46:28,041 INFO L226 Difference]: Without dead ends: 162 [2021-11-19 15:46:28,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-19 15:46:28,045 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:28,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 248 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-19 15:46:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2021-11-19 15:46:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 125 states have internal predecessors, (155), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-19 15:46:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2021-11-19 15:46:28,071 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 25 [2021-11-19 15:46:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:28,072 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2021-11-19 15:46:28,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:46:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2021-11-19 15:46:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 15:46:28,074 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:28,074 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:28,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-19 15:46:28,075 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash -759184931, now seen corresponding path program 1 times [2021-11-19 15:46:28,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:28,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68869892] [2021-11-19 15:46:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:28,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-19 15:46:28,204 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:28,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68869892] [2021-11-19 15:46:28,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68869892] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:28,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218940365] [2021-11-19 15:46:28,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:28,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:28,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:28,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:28,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-19 15:46:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:28,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-19 15:46:28,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:28,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:29,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218940365] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:29,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-19 15:46:29,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 9] total 23 [2021-11-19 15:46:29,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325333439] [2021-11-19 15:46:29,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:29,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 15:46:29,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 15:46:29,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2021-11-19 15:46:29,095 INFO L87 Difference]: Start difference. First operand 153 states and 190 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:29,423 INFO L93 Difference]: Finished difference Result 176 states and 217 transitions. [2021-11-19 15:46:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-19 15:46:29,424 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-19 15:46:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:29,427 INFO L225 Difference]: With dead ends: 176 [2021-11-19 15:46:29,427 INFO L226 Difference]: Without dead ends: 174 [2021-11-19 15:46:29,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2021-11-19 15:46:29,429 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:29,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 326 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 15:46:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-19 15:46:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2021-11-19 15:46:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.310077519379845) internal successors, (169), 137 states have internal predecessors, (169), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-11-19 15:46:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2021-11-19 15:46:29,453 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 25 [2021-11-19 15:46:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:29,453 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2021-11-19 15:46:29,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2021-11-19 15:46:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-19 15:46:29,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:29,463 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:29,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:29,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-19 15:46:29,690 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:29,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:29,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2059896319, now seen corresponding path program 1 times [2021-11-19 15:46:29,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:29,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779048870] [2021-11-19 15:46:29,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:29,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:29,805 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:29,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779048870] [2021-11-19 15:46:29,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779048870] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:29,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105711354] [2021-11-19 15:46:29,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:29,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:29,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:29,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:29,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-19 15:46:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:29,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-19 15:46:29,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:30,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:30,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105711354] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:46:30,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1991916452] [2021-11-19 15:46:30,553 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2021-11-19 15:46:30,553 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:30,554 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:30,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:46:30,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2021-11-19 15:46:30,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103806258] [2021-11-19 15:46:30,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:30,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-19 15:46:30,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-19 15:46:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2021-11-19 15:46:30,564 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 14 states have internal predecessors, (64), 8 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:31,874 INFO L93 Difference]: Finished difference Result 212 states and 265 transitions. [2021-11-19 15:46:31,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-19 15:46:31,875 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 14 states have internal predecessors, (64), 8 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-19 15:46:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:31,877 INFO L225 Difference]: With dead ends: 212 [2021-11-19 15:46:31,878 INFO L226 Difference]: Without dead ends: 209 [2021-11-19 15:46:31,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1587, Unknown=0, NotChecked=0, Total=1892 [2021-11-19 15:46:31,880 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 347 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:31,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 728 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-19 15:46:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-19 15:46:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 196. [2021-11-19 15:46:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 159 states have internal predecessors, (196), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2021-11-19 15:46:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 243 transitions. [2021-11-19 15:46:31,900 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 243 transitions. Word has length 26 [2021-11-19 15:46:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:31,901 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 243 transitions. [2021-11-19 15:46:31,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 14 states have internal predecessors, (64), 8 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 243 transitions. [2021-11-19 15:46:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-19 15:46:31,902 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:31,903 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:31,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:32,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-19 15:46:32,130 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:32,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash 214951410, now seen corresponding path program 1 times [2021-11-19 15:46:32,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:32,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046801404] [2021-11-19 15:46:32,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:32,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:32,218 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:32,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046801404] [2021-11-19 15:46:32,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046801404] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:32,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737069182] [2021-11-19 15:46:32,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:32,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:32,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:32,226 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:32,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 15:46:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:32,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 15:46:32,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 15:46:32,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 15:46:32,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737069182] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:46:32,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2143603979] [2021-11-19 15:46:32,467 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-19 15:46:32,467 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:32,467 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:32,469 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:46:32,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2021-11-19 15:46:32,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501200636] [2021-11-19 15:46:32,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:32,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 15:46:32,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:32,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 15:46:32,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-19 15:46:32,471 INFO L87 Difference]: Start difference. First operand 196 states and 243 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:46:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:32,551 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2021-11-19 15:46:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 15:46:32,553 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-11-19 15:46:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:32,555 INFO L225 Difference]: With dead ends: 210 [2021-11-19 15:46:32,555 INFO L226 Difference]: Without dead ends: 162 [2021-11-19 15:46:32,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-19 15:46:32,556 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:32,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 374 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:46:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-19 15:46:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2021-11-19 15:46:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 124 states have (on average 1.2338709677419355) internal successors, (153), 128 states have internal predecessors, (153), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-11-19 15:46:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2021-11-19 15:46:32,570 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 30 [2021-11-19 15:46:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:32,571 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2021-11-19 15:46:32,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-19 15:46:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2021-11-19 15:46:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-19 15:46:32,572 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:32,572 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:32,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:32,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-19 15:46:32,786 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:32,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1031540798, now seen corresponding path program 1 times [2021-11-19 15:46:32,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:32,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633914096] [2021-11-19 15:46:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:32,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:32,862 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:32,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633914096] [2021-11-19 15:46:32,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633914096] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:32,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424111575] [2021-11-19 15:46:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:32,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:32,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:32,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:32,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-19 15:46:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:32,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-19 15:46:32,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:33,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:33,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424111575] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:46:33,139 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [940201899] [2021-11-19 15:46:33,142 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-11-19 15:46:33,143 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:33,143 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:33,144 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:46:33,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-19 15:46:33,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76457415] [2021-11-19 15:46:33,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:33,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 15:46:33,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 15:46:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-19 15:46:33,147 INFO L87 Difference]: Start difference. First operand 158 states and 190 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-19 15:46:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:33,251 INFO L93 Difference]: Finished difference Result 168 states and 202 transitions. [2021-11-19 15:46:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 15:46:33,252 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2021-11-19 15:46:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:33,254 INFO L225 Difference]: With dead ends: 168 [2021-11-19 15:46:33,254 INFO L226 Difference]: Without dead ends: 167 [2021-11-19 15:46:33,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-11-19 15:46:33,258 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:33,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 531 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-19 15:46:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2021-11-19 15:46:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 132 states have internal predecessors, (158), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (20), 20 states have call predecessors, (20), 18 states have call successors, (20) [2021-11-19 15:46:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 197 transitions. [2021-11-19 15:46:33,272 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 197 transitions. Word has length 29 [2021-11-19 15:46:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:33,272 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 197 transitions. [2021-11-19 15:46:33,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-19 15:46:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 197 transitions. [2021-11-19 15:46:33,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-19 15:46:33,275 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:33,275 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:33,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:33,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-19 15:46:33,494 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:33,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1912993572, now seen corresponding path program 1 times [2021-11-19 15:46:33,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:33,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486107795] [2021-11-19 15:46:33,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:33,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 15:46:33,557 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:33,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486107795] [2021-11-19 15:46:33,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486107795] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:33,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953635871] [2021-11-19 15:46:33,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:33,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:33,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:33,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:33,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 15:46:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:33,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 15:46:33,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:33,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:33,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953635871] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:46:33,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1064504534] [2021-11-19 15:46:33,827 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-19 15:46:33,827 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:33,828 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:33,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:46:33,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2021-11-19 15:46:33,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353419503] [2021-11-19 15:46:33,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:33,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-19 15:46:33,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:33,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-19 15:46:33,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-19 15:46:33,832 INFO L87 Difference]: Start difference. First operand 164 states and 197 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 15:46:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:34,005 INFO L93 Difference]: Finished difference Result 175 states and 212 transitions. [2021-11-19 15:46:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-19 15:46:34,007 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2021-11-19 15:46:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:34,009 INFO L225 Difference]: With dead ends: 175 [2021-11-19 15:46:34,010 INFO L226 Difference]: Without dead ends: 158 [2021-11-19 15:46:34,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-11-19 15:46:34,011 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 45 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:34,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 611 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-19 15:46:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2021-11-19 15:46:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 126 states have internal predecessors, (149), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-11-19 15:46:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 186 transitions. [2021-11-19 15:46:34,026 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 186 transitions. Word has length 30 [2021-11-19 15:46:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:34,027 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 186 transitions. [2021-11-19 15:46:34,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 15:46:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 186 transitions. [2021-11-19 15:46:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-19 15:46:34,028 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:34,029 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:34,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:34,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-19 15:46:34,254 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:34,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1897863652, now seen corresponding path program 1 times [2021-11-19 15:46:34,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:34,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480842880] [2021-11-19 15:46:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:34,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:34,331 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:34,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480842880] [2021-11-19 15:46:34,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480842880] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:34,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19381415] [2021-11-19 15:46:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:34,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:34,334 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:34,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-19 15:46:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:34,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 15:46:34,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:34,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:34,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19381415] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:46:34,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1303661651] [2021-11-19 15:46:34,611 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-11-19 15:46:34,611 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:34,612 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:34,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:46:34,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-19 15:46:34,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986279260] [2021-11-19 15:46:34,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:34,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 15:46:34,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:34,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 15:46:34,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-19 15:46:34,617 INFO L87 Difference]: Start difference. First operand 156 states and 186 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-19 15:46:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:34,691 INFO L93 Difference]: Finished difference Result 164 states and 195 transitions. [2021-11-19 15:46:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 15:46:34,691 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2021-11-19 15:46:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:34,694 INFO L225 Difference]: With dead ends: 164 [2021-11-19 15:46:34,694 INFO L226 Difference]: Without dead ends: 161 [2021-11-19 15:46:34,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-19 15:46:34,696 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 25 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:34,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 479 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:46:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-19 15:46:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2021-11-19 15:46:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 126 states have (on average 1.2063492063492063) internal successors, (152), 129 states have internal predecessors, (152), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (19), 19 states have call predecessors, (19), 18 states have call successors, (19) [2021-11-19 15:46:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2021-11-19 15:46:34,711 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 30 [2021-11-19 15:46:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:34,712 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2021-11-19 15:46:34,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-19 15:46:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2021-11-19 15:46:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 15:46:34,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:34,714 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:34,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:34,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-19 15:46:34,938 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:34,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash 945477369, now seen corresponding path program 2 times [2021-11-19 15:46:34,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:34,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845131941] [2021-11-19 15:46:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:34,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:35,065 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:35,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845131941] [2021-11-19 15:46:35,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845131941] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:35,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106314106] [2021-11-19 15:46:35,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 15:46:35,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:35,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:35,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:35,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-19 15:46:35,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-19 15:46:35,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:46:35,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-19 15:46:35,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-19 15:46:35,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-19 15:46:35,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106314106] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:46:35,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2070734240] [2021-11-19 15:46:35,650 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-19 15:46:35,650 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:35,650 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:35,651 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:46:35,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2021-11-19 15:46:35,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452742991] [2021-11-19 15:46:35,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:35,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-19 15:46:35,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-19 15:46:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2021-11-19 15:46:35,653 INFO L87 Difference]: Start difference. First operand 160 states and 190 transitions. Second operand has 26 states, 25 states have (on average 2.88) internal successors, (72), 16 states have internal predecessors, (72), 11 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:36,553 INFO L93 Difference]: Finished difference Result 216 states and 269 transitions. [2021-11-19 15:46:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-19 15:46:36,558 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 16 states have internal predecessors, (72), 11 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-19 15:46:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:36,560 INFO L225 Difference]: With dead ends: 216 [2021-11-19 15:46:36,560 INFO L226 Difference]: Without dead ends: 214 [2021-11-19 15:46:36,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=1642, Unknown=0, NotChecked=0, Total=1980 [2021-11-19 15:46:36,563 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 367 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:36,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 516 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-19 15:46:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-11-19 15:46:36,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 189. [2021-11-19 15:46:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.2) internal successors, (180), 152 states have internal predecessors, (180), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (23), 23 states have call predecessors, (23), 22 states have call successors, (23) [2021-11-19 15:46:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 226 transitions. [2021-11-19 15:46:36,593 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 226 transitions. Word has length 31 [2021-11-19 15:46:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:36,593 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 226 transitions. [2021-11-19 15:46:36,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 16 states have internal predecessors, (72), 11 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 226 transitions. [2021-11-19 15:46:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-19 15:46:36,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:36,595 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:36,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:36,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-19 15:46:36,822 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:36,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1342949058, now seen corresponding path program 1 times [2021-11-19 15:46:36,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:36,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869462077] [2021-11-19 15:46:36,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:36,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-19 15:46:36,879 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:36,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869462077] [2021-11-19 15:46:36,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869462077] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:36,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807937595] [2021-11-19 15:46:36,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:36,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:36,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:36,882 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:36,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-19 15:46:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:36,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 15:46:36,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-19 15:46:37,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-19 15:46:37,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807937595] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:46:37,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1849287231] [2021-11-19 15:46:37,118 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2021-11-19 15:46:37,118 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:37,118 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:37,120 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:46:37,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-19 15:46:37,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788050134] [2021-11-19 15:46:37,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:37,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 15:46:37,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:37,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 15:46:37,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-19 15:46:37,126 INFO L87 Difference]: Start difference. First operand 189 states and 226 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:37,236 INFO L93 Difference]: Finished difference Result 348 states and 429 transitions. [2021-11-19 15:46:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 15:46:37,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-19 15:46:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:37,239 INFO L225 Difference]: With dead ends: 348 [2021-11-19 15:46:37,239 INFO L226 Difference]: Without dead ends: 178 [2021-11-19 15:46:37,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-19 15:46:37,241 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 43 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:37,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 272 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-19 15:46:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2021-11-19 15:46:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 133 states have internal predecessors, (152), 19 states have call successors, (19), 12 states have call predecessors, (19), 12 states have return successors, (19), 19 states have call predecessors, (19), 18 states have call successors, (19) [2021-11-19 15:46:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2021-11-19 15:46:37,257 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 37 [2021-11-19 15:46:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:37,258 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2021-11-19 15:46:37,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2021-11-19 15:46:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-19 15:46:37,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:37,259 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:37,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:37,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:37,473 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:37,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2084074982, now seen corresponding path program 1 times [2021-11-19 15:46:37,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:37,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440842583] [2021-11-19 15:46:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:37,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 15:46:37,580 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:37,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440842583] [2021-11-19 15:46:37,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440842583] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:37,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619230743] [2021-11-19 15:46:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:37,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:37,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:37,582 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:37,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-19 15:46:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:37,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-19 15:46:37,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-19 15:46:37,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-19 15:46:38,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619230743] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:38,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-19 15:46:38,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 23 [2021-11-19 15:46:38,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240957749] [2021-11-19 15:46:38,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:46:38,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 15:46:38,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 15:46:38,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2021-11-19 15:46:38,038 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:38,230 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2021-11-19 15:46:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-19 15:46:38,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-19 15:46:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:38,232 INFO L225 Difference]: With dead ends: 171 [2021-11-19 15:46:38,232 INFO L226 Difference]: Without dead ends: 170 [2021-11-19 15:46:38,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2021-11-19 15:46:38,234 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 59 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:38,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 230 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-19 15:46:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2021-11-19 15:46:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 132 states have (on average 1.121212121212121) internal successors, (148), 132 states have internal predecessors, (148), 19 states have call successors, (19), 12 states have call predecessors, (19), 12 states have return successors, (19), 19 states have call predecessors, (19), 18 states have call successors, (19) [2021-11-19 15:46:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2021-11-19 15:46:38,246 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 39 [2021-11-19 15:46:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:38,246 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2021-11-19 15:46:38,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 15:46:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2021-11-19 15:46:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-19 15:46:38,248 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:38,248 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:38,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:38,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-11-19 15:46:38,474 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash -794105240, now seen corresponding path program 1 times [2021-11-19 15:46:38,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:38,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747811794] [2021-11-19 15:46:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:38,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 15:46:38,554 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:38,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747811794] [2021-11-19 15:46:38,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747811794] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:38,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503365507] [2021-11-19 15:46:38,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:38,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:38,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:38,556 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:38,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-19 15:46:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:38,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 15:46:38,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 15:46:38,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 15:46:39,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503365507] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:46:39,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1314554967] [2021-11-19 15:46:39,033 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-19 15:46:39,034 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:39,034 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:39,035 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:46:39,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2021-11-19 15:46:39,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005628705] [2021-11-19 15:46:39,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:39,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-19 15:46:39,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:39,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-19 15:46:39,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-11-19 15:46:39,038 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2021-11-19 15:46:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:39,266 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2021-11-19 15:46:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-19 15:46:39,267 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 42 [2021-11-19 15:46:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:39,269 INFO L225 Difference]: With dead ends: 179 [2021-11-19 15:46:39,269 INFO L226 Difference]: Without dead ends: 174 [2021-11-19 15:46:39,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2021-11-19 15:46:39,271 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 99 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:39,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 475 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:46:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-19 15:46:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-11-19 15:46:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 140 states have internal predecessors, (156), 19 states have call successors, (19), 12 states have call predecessors, (19), 14 states have return successors, (21), 21 states have call predecessors, (21), 18 states have call successors, (21) [2021-11-19 15:46:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2021-11-19 15:46:39,284 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 42 [2021-11-19 15:46:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:39,284 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2021-11-19 15:46:39,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2021-11-19 15:46:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2021-11-19 15:46:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-19 15:46:39,286 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:39,286 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:39,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:39,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-19 15:46:39,510 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1545418984, now seen corresponding path program 2 times [2021-11-19 15:46:39,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:39,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697150181] [2021-11-19 15:46:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:39,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-19 15:46:39,705 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:39,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697150181] [2021-11-19 15:46:39,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697150181] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:39,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866641505] [2021-11-19 15:46:39,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 15:46:39,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:39,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:39,708 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:39,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-19 15:46:39,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-11-19 15:46:39,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:46:39,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-19 15:46:39,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-19 15:46:40,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 6 proven. 123 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-19 15:46:41,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866641505] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:46:41,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [353205616] [2021-11-19 15:46:41,166 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-19 15:46:41,166 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:46:41,167 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:46:41,168 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:46:41,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 32 [2021-11-19 15:46:41,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220022299] [2021-11-19 15:46:41,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:46:41,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-19 15:46:41,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:46:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-19 15:46:41,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2021-11-19 15:46:41,171 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand has 33 states, 32 states have (on average 3.21875) internal successors, (103), 31 states have internal predecessors, (103), 10 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2021-11-19 15:46:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:46:41,769 INFO L93 Difference]: Finished difference Result 203 states and 232 transitions. [2021-11-19 15:46:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-19 15:46:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 31 states have internal predecessors, (103), 10 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) Word has length 80 [2021-11-19 15:46:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:46:41,774 INFO L225 Difference]: With dead ends: 203 [2021-11-19 15:46:41,774 INFO L226 Difference]: Without dead ends: 194 [2021-11-19 15:46:41,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 137 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=421, Invalid=1835, Unknown=0, NotChecked=0, Total=2256 [2021-11-19 15:46:41,776 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 115 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 15:46:41,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 1072 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 15:46:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-19 15:46:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-11-19 15:46:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 156 states have (on average 1.1025641025641026) internal successors, (172), 156 states have internal predecessors, (172), 19 states have call successors, (19), 12 states have call predecessors, (19), 18 states have return successors, (25), 25 states have call predecessors, (25), 18 states have call successors, (25) [2021-11-19 15:46:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 216 transitions. [2021-11-19 15:46:41,790 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 216 transitions. Word has length 80 [2021-11-19 15:46:41,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:46:41,791 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 216 transitions. [2021-11-19 15:46:41,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 31 states have internal predecessors, (103), 10 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2021-11-19 15:46:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 216 transitions. [2021-11-19 15:46:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-19 15:46:41,794 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:46:41,794 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:46:41,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-19 15:46:42,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-19 15:46:42,014 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-19 15:46:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:46:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash 985846760, now seen corresponding path program 3 times [2021-11-19 15:46:42,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:46:42,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760361528] [2021-11-19 15:46:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:46:42,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:46:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:46:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-19 15:46:42,370 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:46:42,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760361528] [2021-11-19 15:46:42,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760361528] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:46:42,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204622592] [2021-11-19 15:46:42,371 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 15:46:42,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:46:42,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:46:42,372 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:46:42,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b0060-4449-4c69-8815-3b1ede64ea64/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-19 15:46:42,465 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 15:46:42,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:46:42,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-19 15:46:42,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:46:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-19 15:46:43,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:51,747 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (< v_mult_~n_BEFORE_CALL_30 |c_mult_#in~n|) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_30) 2147483647))) is different from false [2021-11-19 15:46:54,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (< v_mult_~n_BEFORE_CALL_30 |c_mult_#in~n|) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_30 c_mult_~n) 2147483647))) is different from false [2021-11-19 15:46:57,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (< v_mult_~n_BEFORE_CALL_30 |c_mult_#in~n|) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< c_mult_~n |v_mult_#in~n_247|) (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|) c_mult_~n) 2147483646))) is different from false [2021-11-19 15:47:01,304 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30) 2147483647) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |c_mult_#in~n|))) is different from false [2021-11-19 15:47:03,315 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30) 2147483647) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |c_mult_#in~n|))) is different from true [2021-11-19 15:47:08,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 c_mult_~n) 2147483647) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |c_mult_#in~n|))) is different from false [2021-11-19 15:47:10,157 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 c_mult_~n) 2147483647) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |c_mult_#in~n|))) is different from true [2021-11-19 15:47:17,071 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (<= (+ (* 3 c_mult_~n) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< c_mult_~n |v_mult_#in~n_280|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |c_mult_#in~n|))) is different from false [2021-11-19 15:47:19,085 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (<= (+ (* 3 c_mult_~n) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< c_mult_~n |v_mult_#in~n_280|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |c_mult_#in~n|))) is different from true [2021-11-19 15:47:30,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30) 2147483647) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (< v_mult_~n_BEFORE_CALL_32 |c_mult_#in~n|))) is different from false [2021-11-19 15:47:32,649 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30) 2147483647) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (< v_mult_~n_BEFORE_CALL_32 |c_mult_#in~n|))) is different from true [2021-11-19 15:47:51,606 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 c_mult_~n) 2147483647) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (< v_mult_~n_BEFORE_CALL_32 |c_mult_#in~n|))) is different from false [2021-11-19 15:47:53,666 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 c_mult_~n) 2147483647) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (< v_mult_~n_BEFORE_CALL_32 |c_mult_#in~n|))) is different from true [2021-11-19 15:48:19,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (|v_mult_#in~n_301| Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (<= (+ (* 2 c_mult_~n) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_301|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< c_mult_~n |v_mult_#in~n_301|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (< v_mult_~n_BEFORE_CALL_32 |c_mult_#in~n|))) is different from false [2021-11-19 15:48:21,025 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (|v_mult_#in~n_301| Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (<= (+ (* 2 c_mult_~n) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_301|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< c_mult_~n |v_mult_#in~n_301|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (< v_mult_~n_BEFORE_CALL_32 |c_mult_#in~n|))) is different from true [2021-11-19 15:49:19,174 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_33 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_BEFORE_CALL_19| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (|v_mult_#in~n_301| Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_301|) (* 2 v_mult_~n_BEFORE_CALL_33))) (<= |v_mult_#in~n_301| v_mult_~n_BEFORE_CALL_33) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (<= |v_mult_#in~n_BEFORE_CALL_19| v_mult_~n_BEFORE_CALL_32) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))) (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_280|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (<= (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|)) 2147483646))))) (< v_mult_~n_BEFORE_CALL_33 |c_mult_#in~n|) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_BEFORE_CALL_19|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_33 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30) 2147483647) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|))) is different from false [2021-11-19 15:49:21,188 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_33 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_BEFORE_CALL_19| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (|v_mult_#in~n_301| Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_301|) (* 2 v_mult_~n_BEFORE_CALL_33))) (<= |v_mult_#in~n_301| v_mult_~n_BEFORE_CALL_33) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (<= |v_mult_#in~n_BEFORE_CALL_19| v_mult_~n_BEFORE_CALL_32) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))) (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_280|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (<= (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|)) 2147483646))))) (< v_mult_~n_BEFORE_CALL_33 |c_mult_#in~n|) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_BEFORE_CALL_19|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_33 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30) 2147483647) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|))) is different from true [2021-11-19 15:51:12,533 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_33 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_BEFORE_CALL_19| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (|v_mult_#in~n_301| Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_301|) (* 2 v_mult_~n_BEFORE_CALL_33))) (<= |v_mult_#in~n_301| v_mult_~n_BEFORE_CALL_33) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (<= |v_mult_#in~n_BEFORE_CALL_19| v_mult_~n_BEFORE_CALL_32) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))) (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_280|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (<= (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|)) 2147483646))))) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_33 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 c_mult_~n) 2147483647) (< v_mult_~n_BEFORE_CALL_33 |c_mult_#in~n|) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_BEFORE_CALL_19|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|))) is different from false [2021-11-19 15:51:14,546 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_33 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_BEFORE_CALL_19| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (|v_mult_#in~n_301| Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_301|) (* 2 v_mult_~n_BEFORE_CALL_33))) (<= |v_mult_#in~n_301| v_mult_~n_BEFORE_CALL_33) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (<= |v_mult_#in~n_BEFORE_CALL_19| v_mult_~n_BEFORE_CALL_32) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))) (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_280|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (<= (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|)) 2147483646))))) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_33 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 c_mult_~n) 2147483647) (< v_mult_~n_BEFORE_CALL_33 |c_mult_#in~n|) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_BEFORE_CALL_19|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|))) is different from true [2021-11-19 15:54:01,182 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_33 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_BEFORE_CALL_19| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (|v_mult_#in~n_301| Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_301|) (* 2 v_mult_~n_BEFORE_CALL_33))) (<= |v_mult_#in~n_301| v_mult_~n_BEFORE_CALL_33) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (<= |v_mult_#in~n_BEFORE_CALL_19| v_mult_~n_BEFORE_CALL_32) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))) (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_280|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (<= (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|)) 2147483646))))) (< v_mult_~n_BEFORE_CALL_33 |c_mult_#in~n|) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_BEFORE_CALL_19|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (<= (+ (* 3 c_mult_~n) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_33 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30) 2147483646) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|))) is different from false [2021-11-19 15:54:03,453 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_33 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_BEFORE_CALL_19| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (<= |v_mult_#in~n_280| v_mult_~n_BEFORE_CALL_32) (< 2147483646 (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((v_mult_~n_BEFORE_CALL_32 Int) (v_mult_~n_BEFORE_CALL_31 Int) (|v_mult_#in~n_301| Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (<= |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_31) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_301|) (* 2 v_mult_~n_BEFORE_CALL_33))) (<= |v_mult_#in~n_301| v_mult_~n_BEFORE_CALL_33) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|)) 2147483646) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_247|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|))) (<= |v_mult_#in~n_BEFORE_CALL_19| v_mult_~n_BEFORE_CALL_32) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))) (forall ((v_mult_~n_BEFORE_CALL_31 Int) (v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int) (|v_mult_#in~n_280| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_17| v_mult_~n_BEFORE_CALL_30) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_247| v_mult_~n_BEFORE_CALL_31) (forall ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (or (<= (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_201|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|))))) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_280|) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|) (<= (+ (* 3 v_mult_~n_BEFORE_CALL_32) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30 (* 2 |v_mult_#in~n_280|)) 2147483646))))) (< v_mult_~n_BEFORE_CALL_33 |c_mult_#in~n|) (exists ((|v_mult_#in~n_201| Int) (v_mult_~n_BEFORE_CALL_29 Int)) (and (< 2147483646 (+ (* 4 |v_mult_#in~n_201|) v_mult_~n_BEFORE_CALL_29 (* 3 v_mult_~n_BEFORE_CALL_30))) (<= |v_mult_#in~n_BEFORE_CALL_16| v_mult_~n_BEFORE_CALL_29) (<= (* 2 v_mult_~n_BEFORE_CALL_29) (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3)) (<= |v_mult_#in~n_201| v_mult_~n_BEFORE_CALL_30))) (< v_mult_~n_BEFORE_CALL_32 |v_mult_#in~n_BEFORE_CALL_19|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< v_mult_~n_BEFORE_CALL_30 |v_mult_#in~n_BEFORE_CALL_17|) (<= (+ (* 3 c_mult_~n) v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_33 v_mult_~n_BEFORE_CALL_32 v_mult_~n_BEFORE_CALL_31 v_mult_~n_BEFORE_CALL_30) 2147483646) (< v_mult_~n_BEFORE_CALL_31 |v_mult_#in~n_BEFORE_CALL_18|))) is different from true