./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/MultCommutative-2.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_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/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_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/MultCommutative-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/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_e24059e6-51dc-42da-b950-932bf778624f/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 ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 13:35:07,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:35:07,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:35:07,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:35:07,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:35:07,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:35:07,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:35:07,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:35:07,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:35:07,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:35:07,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:35:07,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:35:07,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:35:07,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:35:07,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:35:07,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:35:07,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:35:07,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:35:07,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:35:07,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:35:07,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:35:07,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:35:07,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:35:07,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:35:07,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:35:07,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:35:07,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:35:07,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:35:07,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:35:07,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:35:07,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:35:07,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:35:07,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:35:07,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:35:07,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:35:07,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:35:07,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:35:07,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:35:07,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:35:07,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:35:07,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:35:07,247 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/config/svcomp-Overflow-32bit-Taipan_Default.epf [2021-11-19 13:35:07,273 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:35:07,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:35:07,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:35:07,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:35:07,275 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:35:07,276 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:35:07,276 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:35:07,276 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 13:35:07,276 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:35:07,277 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:35:07,277 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 13:35:07,277 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 13:35:07,277 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:35:07,278 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 13:35:07,278 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 13:35:07,278 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 13:35:07,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:35:07,279 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:35:07,279 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 13:35:07,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 13:35:07,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:35:07,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:35:07,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 13:35:07,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:35:07,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 13:35:07,281 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-19 13:35:07,281 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:35:07,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 13:35:07,282 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:35:07,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 13:35:07,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:35:07,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:35:07,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:35:07,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:35:07,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:35:07,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 13:35:07,284 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 13:35:07,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 13:35:07,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 13:35:07,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:35:07,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:35:07,285 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_e24059e6-51dc-42da-b950-932bf778624f/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_e24059e6-51dc-42da-b950-932bf778624f/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 -> ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd [2021-11-19 13:35:07,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:35:07,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:35:07,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:35:07,565 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:35:07,566 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:35:07,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/recursive/MultCommutative-2.c [2021-11-19 13:35:07,630 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/data/347cb2b62/00b58224fe594fe0a4b047236087bbf0/FLAG7c92ab9fb [2021-11-19 13:35:08,044 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:35:08,045 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/sv-benchmarks/c/recursive/MultCommutative-2.c [2021-11-19 13:35:08,051 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/data/347cb2b62/00b58224fe594fe0a4b047236087bbf0/FLAG7c92ab9fb [2021-11-19 13:35:08,443 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/data/347cb2b62/00b58224fe594fe0a4b047236087bbf0 [2021-11-19 13:35:08,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:35:08,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:35:08,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:35:08,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:35:08,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:35:08,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34315ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08, skipping insertion in model container [2021-11-19 13:35:08,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:35:08,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:35:08,697 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_e24059e6-51dc-42da-b950-932bf778624f/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2021-11-19 13:35:08,698 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:35:08,711 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 13:35:08,749 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_e24059e6-51dc-42da-b950-932bf778624f/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2021-11-19 13:35:08,756 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:35:08,776 INFO L208 MainTranslator]: Completed translation [2021-11-19 13:35:08,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08 WrapperNode [2021-11-19 13:35:08,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:35:08,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 13:35:08,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 13:35:08,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 13:35:08,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,825 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2021-11-19 13:35:08,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 13:35:08,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 13:35:08,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 13:35:08,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 13:35:08,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 13:35:08,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 13:35:08,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 13:35:08,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 13:35:08,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (1/1) ... [2021-11-19 13:35:08,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:35:08,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:08,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 13:35:08,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 13:35:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 13:35:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2021-11-19 13:35:09,002 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2021-11-19 13:35:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 13:35:09,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 13:35:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 13:35:09,085 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 13:35:09,088 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 13:35:09,257 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 13:35:09,303 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 13:35:09,304 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 13:35:09,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:35:09 BoogieIcfgContainer [2021-11-19 13:35:09,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 13:35:09,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 13:35:09,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 13:35:09,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 13:35:09,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:35:08" (1/3) ... [2021-11-19 13:35:09,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263cf2ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:35:09, skipping insertion in model container [2021-11-19 13:35:09,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:35:08" (2/3) ... [2021-11-19 13:35:09,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263cf2ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:35:09, skipping insertion in model container [2021-11-19 13:35:09,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:35:09" (3/3) ... [2021-11-19 13:35:09,336 INFO L111 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2021-11-19 13:35:09,343 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 13:35:09,343 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-19 13:35:09,415 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 13:35:09,443 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 13:35:09,443 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-19 13:35:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 13:35:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-19 13:35:09,468 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:09,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:09,469 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:09,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1027513993, now seen corresponding path program 1 times [2021-11-19 13:35:09,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:09,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848583286] [2021-11-19 13:35:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:09,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:09,689 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 13:35:09,689 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:09,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848583286] [2021-11-19 13:35:09,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848583286] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:35:09,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:35:09,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 13:35:09,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502296825] [2021-11-19 13:35:09,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:35:09,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:35:09,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:09,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:35:09,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:35:09,739 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:35:09,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:09,885 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2021-11-19 13:35:09,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:35:09,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-19 13:35:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:09,900 INFO L225 Difference]: With dead ends: 73 [2021-11-19 13:35:09,900 INFO L226 Difference]: Without dead ends: 42 [2021-11-19 13:35:09,905 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 13:35:09,910 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:09,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 77 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:35:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-19 13:35:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2021-11-19 13:35:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-19 13:35:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2021-11-19 13:35:09,965 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 7 [2021-11-19 13:35:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:09,965 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2021-11-19 13:35:09,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:35:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2021-11-19 13:35:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-19 13:35:09,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:09,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:09,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 13:35:09,968 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1788169763, now seen corresponding path program 1 times [2021-11-19 13:35:09,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:09,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412633121] [2021-11-19 13:35:09,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:09,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:10,046 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 13:35:10,047 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:10,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412633121] [2021-11-19 13:35:10,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412633121] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:35:10,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:35:10,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 13:35:10,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090252239] [2021-11-19 13:35:10,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:35:10,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:35:10,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:35:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:35:10,057 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:35:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:10,210 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2021-11-19 13:35:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:35:10,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-19 13:35:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:10,216 INFO L225 Difference]: With dead ends: 58 [2021-11-19 13:35:10,217 INFO L226 Difference]: Without dead ends: 56 [2021-11-19 13:35:10,218 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 13:35:10,221 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:10,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:35:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-19 13:35:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2021-11-19 13:35:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 41 states have internal predecessors, (51), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-19 13:35:10,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2021-11-19 13:35:10,254 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 8 [2021-11-19 13:35:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:10,255 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2021-11-19 13:35:10,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:35:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2021-11-19 13:35:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 13:35:10,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:10,259 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:10,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 13:35:10,260 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:10,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1125158968, now seen corresponding path program 1 times [2021-11-19 13:35:10,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:10,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808539210] [2021-11-19 13:35:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:10,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:10,341 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 13:35:10,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:10,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808539210] [2021-11-19 13:35:10,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808539210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:35:10,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:35:10,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 13:35:10,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851722581] [2021-11-19 13:35:10,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:35:10,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:35:10,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:35:10,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:35:10,347 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 13:35:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:10,435 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2021-11-19 13:35:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:35:10,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2021-11-19 13:35:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:10,439 INFO L225 Difference]: With dead ends: 76 [2021-11-19 13:35:10,439 INFO L226 Difference]: Without dead ends: 75 [2021-11-19 13:35:10,440 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 13:35:10,442 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:10,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:35:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-19 13:35:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2021-11-19 13:35:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 53 states have internal predecessors, (67), 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 13:35:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2021-11-19 13:35:10,463 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 13 [2021-11-19 13:35:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:10,463 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2021-11-19 13:35:10,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 13:35:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2021-11-19 13:35:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-19 13:35:10,465 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:10,465 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:10,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 13:35:10,466 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash -691954174, now seen corresponding path program 1 times [2021-11-19 13:35:10,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:10,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361404093] [2021-11-19 13:35:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:10,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:10,584 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 13:35:10,585 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:10,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361404093] [2021-11-19 13:35:10,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361404093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:35:10,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:35:10,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 13:35:10,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927516743] [2021-11-19 13:35:10,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:35:10,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:35:10,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:10,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:35:10,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:35:10,592 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 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 13:35:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:10,684 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2021-11-19 13:35:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:35:10,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 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 14 [2021-11-19 13:35:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:10,688 INFO L225 Difference]: With dead ends: 120 [2021-11-19 13:35:10,688 INFO L226 Difference]: Without dead ends: 84 [2021-11-19 13:35:10,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 13:35:10,691 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:10,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 86 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:35:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-19 13:35:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2021-11-19 13:35:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 60 states have internal predecessors, (77), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-19 13:35:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2021-11-19 13:35:10,712 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 14 [2021-11-19 13:35:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:10,712 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2021-11-19 13:35:10,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 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 13:35:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2021-11-19 13:35:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 13:35:10,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:10,714 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:10,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-19 13:35:10,715 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:10,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash 24264138, now seen corresponding path program 1 times [2021-11-19 13:35:10,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:10,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031531986] [2021-11-19 13:35:10,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:10,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:35:10,805 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:10,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031531986] [2021-11-19 13:35:10,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031531986] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:35:10,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:35:10,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 13:35:10,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131774448] [2021-11-19 13:35:10,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:35:10,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:35:10,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:35:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:35:10,811 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 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 13:35:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:10,926 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2021-11-19 13:35:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:35:10,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 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 15 [2021-11-19 13:35:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:10,932 INFO L225 Difference]: With dead ends: 101 [2021-11-19 13:35:10,932 INFO L226 Difference]: Without dead ends: 100 [2021-11-19 13:35:10,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 13:35:10,938 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:10,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 99 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:35:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-19 13:35:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2021-11-19 13:35:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 72 states have internal predecessors, (92), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-11-19 13:35:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2021-11-19 13:35:10,970 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 15 [2021-11-19 13:35:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:10,970 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2021-11-19 13:35:10,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 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 13:35:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2021-11-19 13:35:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-19 13:35:10,972 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:10,972 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:10,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-19 13:35:10,972 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:10,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1116235770, now seen corresponding path program 1 times [2021-11-19 13:35:10,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:10,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091521274] [2021-11-19 13:35:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:10,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 13:35:11,088 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:11,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091521274] [2021-11-19 13:35:11,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091521274] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:35:11,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:35:11,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 13:35:11,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144553646] [2021-11-19 13:35:11,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:35:11,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:35:11,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:11,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:35:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:35:11,091 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 13:35:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:11,148 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2021-11-19 13:35:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 13:35:11,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 18 [2021-11-19 13:35:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:11,150 INFO L225 Difference]: With dead ends: 132 [2021-11-19 13:35:11,150 INFO L226 Difference]: Without dead ends: 58 [2021-11-19 13:35:11,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:35:11,154 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:11,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 13:35:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-19 13:35:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2021-11-19 13:35:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-19 13:35:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2021-11-19 13:35:11,165 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 18 [2021-11-19 13:35:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:11,166 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2021-11-19 13:35:11,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 13:35:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2021-11-19 13:35:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-19 13:35:11,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:11,167 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:11,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-19 13:35:11,168 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash 937076250, now seen corresponding path program 1 times [2021-11-19 13:35:11,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:11,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613869194] [2021-11-19 13:35:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:11,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:11,269 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 13:35:11,269 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:11,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613869194] [2021-11-19 13:35:11,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613869194] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:35:11,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581514059] [2021-11-19 13:35:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:11,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:11,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:11,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:35:11,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 13:35:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:11,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 13:35:11,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:11,474 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 13:35:11,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:11,601 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 13:35:11,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581514059] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:35:11,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2077764042] [2021-11-19 13:35:11,626 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-19 13:35:11,626 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 13:35:11,637 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 13:35:11,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:35:11,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-19 13:35:11,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909074831] [2021-11-19 13:35:11,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:35:11,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 13:35:11,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 13:35:11,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-19 13:35:11,648 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 13:35:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:11,820 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2021-11-19 13:35:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-19 13:35:11,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2021-11-19 13:35:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:11,823 INFO L225 Difference]: With dead ends: 66 [2021-11-19 13:35:11,824 INFO L226 Difference]: Without dead ends: 65 [2021-11-19 13:35:11,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 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 13:35:11,832 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:11,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 101 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:35:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-19 13:35:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2021-11-19 13:35:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-19 13:35:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2021-11-19 13:35:11,850 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 17 [2021-11-19 13:35:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:11,851 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2021-11-19 13:35:11,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 13:35:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2021-11-19 13:35:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-19 13:35:11,852 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:11,853 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:11,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 13:35:12,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:12,054 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1015407268, now seen corresponding path program 1 times [2021-11-19 13:35:12,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:12,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825968736] [2021-11-19 13:35:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:12,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:12,182 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 13:35:12,182 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:12,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825968736] [2021-11-19 13:35:12,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825968736] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:35:12,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382637331] [2021-11-19 13:35:12,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:12,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:12,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:12,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:35:12,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-19 13:35:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:12,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:35:12,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:12,333 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 13:35:12,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:12,398 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 13:35:12,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382637331] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:35:12,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [16461663] [2021-11-19 13:35:12,406 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-19 13:35:12,406 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 13:35:12,407 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 13:35:12,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:35:12,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-11-19 13:35:12,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807684730] [2021-11-19 13:35:12,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:35:12,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 13:35:12,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:12,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 13:35:12,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-19 13:35:12,411 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 13:35:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:12,499 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2021-11-19 13:35:12,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-19 13:35:12,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-11-19 13:35:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:12,501 INFO L225 Difference]: With dead ends: 64 [2021-11-19 13:35:12,501 INFO L226 Difference]: Without dead ends: 63 [2021-11-19 13:35:12,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-11-19 13:35:12,505 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:12,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 78 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 13:35:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-19 13:35:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2021-11-19 13:35:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-19 13:35:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2021-11-19 13:35:12,531 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 18 [2021-11-19 13:35:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:12,532 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2021-11-19 13:35:12,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 13:35:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2021-11-19 13:35:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-19 13:35:12,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:12,537 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:12,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-19 13:35:12,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:12,738 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2063375789, now seen corresponding path program 1 times [2021-11-19 13:35:12,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:12,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907838904] [2021-11-19 13:35:12,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:12,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 13:35:12,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:12,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907838904] [2021-11-19 13:35:12,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907838904] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:35:12,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295461329] [2021-11-19 13:35:12,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:12,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:12,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:12,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:35:12,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-19 13:35:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:12,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-19 13:35:12,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 13:35:13,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 13:35:13,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295461329] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:35:13,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1093925868] [2021-11-19 13:35:13,134 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 13:35:13,135 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 13:35:13,135 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 13:35:13,136 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:35:13,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2021-11-19 13:35:13,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583902565] [2021-11-19 13:35:13,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:35:13,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-19 13:35:13,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:13,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-19 13:35:13,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-19 13:35:13,140 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 13:35:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:13,327 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2021-11-19 13:35:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-19 13:35:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-11-19 13:35:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:13,330 INFO L225 Difference]: With dead ends: 93 [2021-11-19 13:35:13,330 INFO L226 Difference]: Without dead ends: 92 [2021-11-19 13:35:13,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-11-19 13:35:13,333 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:13,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 82 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:35:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-19 13:35:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2021-11-19 13:35:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-19 13:35:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2021-11-19 13:35:13,358 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 24 [2021-11-19 13:35:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:13,360 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2021-11-19 13:35:13,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 13:35:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2021-11-19 13:35:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 13:35:13,363 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:13,363 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:13,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-19 13:35:13,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:13,580 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash 459860035, now seen corresponding path program 1 times [2021-11-19 13:35:13,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:13,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719406910] [2021-11-19 13:35:13,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:13,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-19 13:35:13,659 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:13,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719406910] [2021-11-19 13:35:13,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719406910] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:35:13,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496113029] [2021-11-19 13:35:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:13,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:13,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:13,666 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:35:13,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 13:35:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:13,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:35:13,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 13:35:13,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 13:35:13,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496113029] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:35:13,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [449631620] [2021-11-19 13:35:13,867 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-19 13:35:13,868 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 13:35:13,869 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 13:35:13,869 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:35:13,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-11-19 13:35:13,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178319210] [2021-11-19 13:35:13,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:35:13,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 13:35:13,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:13,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 13:35:13,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-19 13:35:13,873 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 13:35:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:13,965 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2021-11-19 13:35:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-19 13:35:13,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-11-19 13:35:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:13,968 INFO L225 Difference]: With dead ends: 96 [2021-11-19 13:35:13,968 INFO L226 Difference]: Without dead ends: 63 [2021-11-19 13:35:13,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-11-19 13:35:13,970 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:13,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 134 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 13:35:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-19 13:35:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2021-11-19 13:35:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 42 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-19 13:35:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2021-11-19 13:35:13,979 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 25 [2021-11-19 13:35:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:13,979 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2021-11-19 13:35:13,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 13:35:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2021-11-19 13:35:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-19 13:35:13,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:13,985 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:14,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-19 13:35:14,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-19 13:35:14,202 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:14,202 INFO L85 PathProgramCache]: Analyzing trace with hash 385020750, now seen corresponding path program 1 times [2021-11-19 13:35:14,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:14,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120894984] [2021-11-19 13:35:14,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:14,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 13:35:14,317 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:14,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120894984] [2021-11-19 13:35:14,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120894984] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:35:14,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671075841] [2021-11-19 13:35:14,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:14,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:14,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:14,322 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:35:14,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-19 13:35:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:14,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 13:35:14,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 13:35:14,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 13:35:14,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671075841] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:35:14,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [217402153] [2021-11-19 13:35:14,777 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-19 13:35:14,777 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 13:35:14,778 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 13:35:14,783 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:35:14,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-11-19 13:35:14,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181010298] [2021-11-19 13:35:14,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:35:14,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 13:35:14,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:14,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 13:35:14,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-11-19 13:35:14,789 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-19 13:35:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:15,103 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2021-11-19 13:35:15,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-19 13:35:15,104 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2021-11-19 13:35:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:15,105 INFO L225 Difference]: With dead ends: 86 [2021-11-19 13:35:15,105 INFO L226 Difference]: Without dead ends: 85 [2021-11-19 13:35:15,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2021-11-19 13:35:15,107 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 60 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:15,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 132 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:35:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-19 13:35:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2021-11-19 13:35:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 50 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-19 13:35:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2021-11-19 13:35:15,115 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 28 [2021-11-19 13:35:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:15,115 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2021-11-19 13:35:15,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-19 13:35:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2021-11-19 13:35:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-19 13:35:15,117 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:15,117 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:15,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-19 13:35:15,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:15,338 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash -377928031, now seen corresponding path program 1 times [2021-11-19 13:35:15,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:15,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420806947] [2021-11-19 13:35:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:15,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 13:35:15,496 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:15,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420806947] [2021-11-19 13:35:15,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420806947] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:35:15,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794508898] [2021-11-19 13:35:15,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:15,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:15,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:15,497 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:35:15,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 13:35:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:15,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 13:35:15,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 13:35:15,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-19 13:35:15,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794508898] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:35:15,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531343289] [2021-11-19 13:35:15,972 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-19 13:35:15,973 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 13:35:15,973 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 13:35:15,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:35:15,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2021-11-19 13:35:15,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438353761] [2021-11-19 13:35:15,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:35:15,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-19 13:35:15,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:15,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-19 13:35:15,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-11-19 13:35:15,977 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-19 13:35:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:16,442 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2021-11-19 13:35:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-19 13:35:16,442 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 35 [2021-11-19 13:35:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:16,444 INFO L225 Difference]: With dead ends: 128 [2021-11-19 13:35:16,444 INFO L226 Difference]: Without dead ends: 123 [2021-11-19 13:35:16,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2021-11-19 13:35:16,446 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:16,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 90 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 13:35:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-19 13:35:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 68. [2021-11-19 13:35:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 53 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2021-11-19 13:35:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2021-11-19 13:35:16,454 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 35 [2021-11-19 13:35:16,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:16,455 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2021-11-19 13:35:16,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-19 13:35:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2021-11-19 13:35:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-19 13:35:16,457 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:16,457 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:16,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-19 13:35:16,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:16,682 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash 442028402, now seen corresponding path program 2 times [2021-11-19 13:35:16,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:16,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823292276] [2021-11-19 13:35:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:16,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-19 13:35:16,901 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:16,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823292276] [2021-11-19 13:35:16,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823292276] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:35:16,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828606843] [2021-11-19 13:35:16,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:35:16,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:16,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:16,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:35:16,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-19 13:35:16,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-11-19 13:35:16,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:35:16,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-19 13:35:16,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-19 13:35:17,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 10 proven. 96 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-19 13:35:18,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828606843] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:35:18,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [489722638] [2021-11-19 13:35:18,435 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-19 13:35:18,435 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 13:35:18,436 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 13:35:18,436 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:35:18,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 30 [2021-11-19 13:35:18,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90300047] [2021-11-19 13:35:18,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:35:18,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-19 13:35:18,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:18,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-19 13:35:18,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2021-11-19 13:35:18,438 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2021-11-19 13:35:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:19,293 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2021-11-19 13:35:19,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-19 13:35:19,293 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) Word has length 62 [2021-11-19 13:35:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:19,295 INFO L225 Difference]: With dead ends: 139 [2021-11-19 13:35:19,295 INFO L226 Difference]: Without dead ends: 138 [2021-11-19 13:35:19,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=479, Invalid=2601, Unknown=0, NotChecked=0, Total=3080 [2021-11-19 13:35:19,298 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 174 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:19,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 123 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 13:35:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-19 13:35:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 88. [2021-11-19 13:35:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 69 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 11 states have return successors, (20), 14 states have call predecessors, (20), 5 states have call successors, (20) [2021-11-19 13:35:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-11-19 13:35:19,312 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 62 [2021-11-19 13:35:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:19,313 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-11-19 13:35:19,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2021-11-19 13:35:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-11-19 13:35:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-19 13:35:19,315 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:19,315 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:19,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-19 13:35:19,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-19 13:35:19,535 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:19,536 INFO L85 PathProgramCache]: Analyzing trace with hash -325154713, now seen corresponding path program 2 times [2021-11-19 13:35:19,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:19,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729769565] [2021-11-19 13:35:19,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:19,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-19 13:35:19,656 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:19,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729769565] [2021-11-19 13:35:19,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729769565] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:35:19,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941930900] [2021-11-19 13:35:19,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:35:19,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:19,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:19,658 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:35:19,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-19 13:35:19,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-19 13:35:19,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:35:19,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-19 13:35:19,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-19 13:35:19,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-19 13:35:20,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941930900] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:35:20,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [636099261] [2021-11-19 13:35:20,235 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-19 13:35:20,235 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 13:35:20,236 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 13:35:20,238 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:35:20,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-11-19 13:35:20,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360460171] [2021-11-19 13:35:20,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:35:20,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-19 13:35:20,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:20,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-19 13:35:20,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-11-19 13:35:20,242 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-19 13:35:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:20,548 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2021-11-19 13:35:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-19 13:35:20,549 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 46 [2021-11-19 13:35:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:20,550 INFO L225 Difference]: With dead ends: 109 [2021-11-19 13:35:20,550 INFO L226 Difference]: Without dead ends: 104 [2021-11-19 13:35:20,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2021-11-19 13:35:20,552 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 86 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:20,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 131 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:35:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-19 13:35:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2021-11-19 13:35:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.064102564102564) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 13 states have return successors, (22), 16 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-19 13:35:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2021-11-19 13:35:20,566 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 46 [2021-11-19 13:35:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:20,566 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2021-11-19 13:35:20,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-19 13:35:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2021-11-19 13:35:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-19 13:35:20,572 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:20,572 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:20,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-19 13:35:20,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:20,796 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:20,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash -674862935, now seen corresponding path program 3 times [2021-11-19 13:35:20,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:20,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953295110] [2021-11-19 13:35:20,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:20,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 115 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-19 13:35:21,063 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:21,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953295110] [2021-11-19 13:35:21,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953295110] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:35:21,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931394030] [2021-11-19 13:35:21,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 13:35:21,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:21,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:21,070 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:35:21,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-19 13:35:21,134 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 13:35:21,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:35:21,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-19 13:35:21,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 115 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-19 13:35:21,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:35:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 12 proven. 117 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-19 13:35:22,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931394030] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:35:22,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [404854284] [2021-11-19 13:35:22,615 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-19 13:35:22,615 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 13:35:22,616 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 13:35:22,617 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:35:22,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 36 [2021-11-19 13:35:22,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336363686] [2021-11-19 13:35:22,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:35:22,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-19 13:35:22,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:35:22,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-19 13:35:22,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2021-11-19 13:35:22,620 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) [2021-11-19 13:35:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:35:24,246 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2021-11-19 13:35:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-19 13:35:24,247 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) Word has length 68 [2021-11-19 13:35:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:35:24,248 INFO L225 Difference]: With dead ends: 187 [2021-11-19 13:35:24,248 INFO L226 Difference]: Without dead ends: 176 [2021-11-19 13:35:24,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=924, Invalid=5082, Unknown=0, NotChecked=0, Total=6006 [2021-11-19 13:35:24,252 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 197 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 13:35:24,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 189 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-19 13:35:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-19 13:35:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 161. [2021-11-19 13:35:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.0546875) internal successors, (135), 127 states have internal predecessors, (135), 9 states have call successors, (9), 6 states have call predecessors, (9), 23 states have return successors, (33), 27 states have call predecessors, (33), 7 states have call successors, (33) [2021-11-19 13:35:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions. [2021-11-19 13:35:24,263 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 68 [2021-11-19 13:35:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:35:24,265 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 177 transitions. [2021-11-19 13:35:24,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) [2021-11-19 13:35:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2021-11-19 13:35:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-19 13:35:24,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:35:24,268 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2021-11-19 13:35:24,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-19 13:35:24,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:24,494 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-19 13:35:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:35:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash 147099220, now seen corresponding path program 3 times [2021-11-19 13:35:24,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:35:24,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386736202] [2021-11-19 13:35:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:35:24,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:35:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:35:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-11-19 13:35:24,846 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:35:24,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386736202] [2021-11-19 13:35:24,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386736202] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:35:24,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202419556] [2021-11-19 13:35:24,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 13:35:24,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:35:24,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:35:24,848 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:35:24,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e24059e6-51dc-42da-b950-932bf778624f/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-19 13:35:24,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 13:35:24,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:35:24,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-19 13:35:24,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:35:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-11-19 13:35:25,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:36:10,862 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_47 |c_mult_#in~n|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) is different from false [2021-11-19 13:36:13,998 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_47 |c_mult_#in~n|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 c_mult_~n) 1879048192))) is different from false [2021-11-19 13:36:18,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_47 |c_mult_#in~n|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 c_mult_~n) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (< c_mult_~n |v_mult_#in~n_350|))) is different from false [2021-11-19 13:36:24,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< v_mult_~n_BEFORE_CALL_48 |c_mult_#in~n|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from false [2021-11-19 13:36:26,228 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< v_mult_~n_BEFORE_CALL_48 |c_mult_#in~n|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from true [2021-11-19 13:36:34,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 c_mult_~n) 1879048192) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< v_mult_~n_BEFORE_CALL_48 |c_mult_#in~n|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from false [2021-11-19 13:36:36,328 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 c_mult_~n) 1879048192) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< v_mult_~n_BEFORE_CALL_48 |c_mult_#in~n|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from true [2021-11-19 13:36:47,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< c_mult_~n |v_mult_#in~n_371|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 2 c_mult_~n) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|)) 1879048192) (< v_mult_~n_BEFORE_CALL_48 |c_mult_#in~n|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from false [2021-11-19 13:36:49,261 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< c_mult_~n |v_mult_#in~n_371|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 2 c_mult_~n) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|)) 1879048192) (< v_mult_~n_BEFORE_CALL_48 |c_mult_#in~n|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from true [2021-11-19 13:37:11,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_49 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (exists ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (< 1879048192 (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_371| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from false [2021-11-19 13:37:13,276 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_49 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (exists ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (< 1879048192 (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_371| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from true [2021-11-19 13:37:52,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 c_mult_~n) 1879048192) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_49 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (exists ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (< 1879048192 (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_371| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from false [2021-11-19 13:37:55,055 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 c_mult_~n) 1879048192) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_49 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (exists ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (< 1879048192 (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_371| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from true [2021-11-19 13:38:55,782 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (<= (+ (* 3 c_mult_~n) v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_49 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (exists ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (< 1879048192 (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_371| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from false [2021-11-19 13:38:58,005 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (<= (+ (* 3 c_mult_~n) v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_49 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (exists ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (< 1879048192 (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_371| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from true [2021-11-19 13:41:22,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int) (v_mult_~n_BEFORE_CALL_50 Int) (|v_mult_#in~n_BEFORE_CALL_28| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (exists ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_28| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (forall ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|)) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (< v_mult_~n_BEFORE_CALL_49 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 v_mult_~n_BEFORE_CALL_50) v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)))) (< v_mult_~n_BEFORE_CALL_49 |v_mult_#in~n_BEFORE_CALL_28|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 v_mult_~n_BEFORE_CALL_50) 1879048192) (< v_mult_~n_BEFORE_CALL_50 |c_mult_#in~n|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (exists ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (< 1879048192 (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_371| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from false [2021-11-19 13:41:24,483 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int) (v_mult_~n_BEFORE_CALL_50 Int) (|v_mult_#in~n_BEFORE_CALL_28| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (exists ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_28| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (forall ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|)) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (< v_mult_~n_BEFORE_CALL_49 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 v_mult_~n_BEFORE_CALL_50) v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)))) (< v_mult_~n_BEFORE_CALL_49 |v_mult_#in~n_BEFORE_CALL_28|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 v_mult_~n_BEFORE_CALL_50) 1879048192) (< v_mult_~n_BEFORE_CALL_50 |c_mult_#in~n|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (exists ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (< 1879048192 (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_371| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from true [2021-11-19 13:45:52,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int) (v_mult_~n_BEFORE_CALL_50 Int) (|v_mult_#in~n_BEFORE_CALL_28| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (exists ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_28| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (forall ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|)) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (< v_mult_~n_BEFORE_CALL_49 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 v_mult_~n_BEFORE_CALL_50) v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)))) (< v_mult_~n_BEFORE_CALL_49 |v_mult_#in~n_BEFORE_CALL_28|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 v_mult_~n_BEFORE_CALL_50 c_mult_~n) 1879048192) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< v_mult_~n_BEFORE_CALL_50 |c_mult_#in~n|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (exists ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (< 1879048192 (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_371| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from false [2021-11-19 13:45:54,625 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int) (v_mult_~n_BEFORE_CALL_50 Int) (|v_mult_#in~n_BEFORE_CALL_28| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (exists ((v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_49 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_27| Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_28| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (forall ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_BEFORE_CALL_27|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|)) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (< v_mult_~n_BEFORE_CALL_49 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 v_mult_~n_BEFORE_CALL_50) v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)))) (< v_mult_~n_BEFORE_CALL_49 |v_mult_#in~n_BEFORE_CALL_28|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (<= (+ |c_mult_#t~ret5| v_mult_~n_BEFORE_CALL_49 v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 v_mult_~n_BEFORE_CALL_50 c_mult_~n) 1879048192) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (< v_mult_~n_BEFORE_CALL_50 |c_mult_#in~n|) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (exists ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (< 1879048192 (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46)) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= |v_mult_#in~n_350| v_mult_~n_BEFORE_CALL_48) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))) (exists ((|v_mult_#in~n_371| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (v_mult_~n_BEFORE_CALL_48 Int) (|v_mult_#in~n_BEFORE_CALL_26| Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (and (< 1879048192 (+ (* 2 v_mult_~n_BEFORE_CALL_49) v_mult_~n_BEFORE_CALL_48 v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_371|))) (<= |v_mult_#in~n_371| v_mult_~n_BEFORE_CALL_49) (<= |v_mult_#in~n_BEFORE_CALL_26| v_mult_~n_BEFORE_CALL_47) (forall ((|v_mult_#in~n_350| Int) (v_mult_~n_BEFORE_CALL_47 Int) (v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_BEFORE_CALL_25| Int)) (or (< v_mult_~n_BEFORE_CALL_48 |v_mult_#in~n_350|) (exists ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (and (<= |v_mult_#in~n_319| |v_mult_#in~n_317|) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)) (< 1879048192 (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|))) (<= |v_mult_#in~n_317| v_mult_~n_BEFORE_CALL_47))) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_BEFORE_CALL_26|) (<= (+ (* 3 |v_mult_#in~n_350|) (* 2 v_mult_~n_BEFORE_CALL_48) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46) 1879048192) (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|))) (<= |v_mult_#in~n_BEFORE_CALL_27| v_mult_~n_BEFORE_CALL_48) (<= |v_mult_#in~n_BEFORE_CALL_25| v_mult_~n_BEFORE_CALL_46) (forall ((v_mult_~n_BEFORE_CALL_46 Int) (|v_mult_#in~n_319| Int) (|v_mult_#in~n_317| Int)) (or (< (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_46) (< v_mult_~n_BEFORE_CALL_46 |v_mult_#in~n_BEFORE_CALL_25|) (<= (+ (* 3 |v_mult_#in~n_319|) v_mult_~n_BEFORE_CALL_47 v_mult_~n_BEFORE_CALL_46 (* 2 |v_mult_#in~n_317|)) 1879048192) (< |v_mult_#in~n_317| |v_mult_#in~n_319|) (< v_mult_~n_BEFORE_CALL_47 |v_mult_#in~n_317|))) (<= v_mult_~n_BEFORE_CALL_46 (div (div (+ 1879048192 (* v_mult_~n_BEFORE_CALL_46 (- 3))) 2) 2)))))) is different from true