./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/MultCommutative-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/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_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/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_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer 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 15:43:13,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 15:43:13,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 15:43:13,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 15:43:13,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 15:43:13,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 15:43:13,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 15:43:13,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 15:43:13,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 15:43:13,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 15:43:13,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 15:43:13,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 15:43:13,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 15:43:13,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 15:43:13,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 15:43:13,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 15:43:13,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 15:43:13,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 15:43:13,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 15:43:13,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 15:43:13,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 15:43:13,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 15:43:13,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 15:43:13,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 15:43:13,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 15:43:13,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 15:43:13,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 15:43:13,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 15:43:13,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 15:43:13,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 15:43:13,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 15:43:13,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 15:43:13,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 15:43:13,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 15:43:13,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 15:43:13,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 15:43:13,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 15:43:13,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 15:43:13,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 15:43:13,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 15:43:13,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 15:43:13,368 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 15:43:13,413 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 15:43:13,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 15:43:13,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 15:43:13,415 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 15:43:13,415 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 15:43:13,416 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 15:43:13,416 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 15:43:13,416 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 15:43:13,416 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 15:43:13,416 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 15:43:13,424 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 15:43:13,424 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 15:43:13,425 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 15:43:13,425 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 15:43:13,425 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 15:43:13,425 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 15:43:13,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 15:43:13,427 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 15:43:13,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 15:43:13,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 15:43:13,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 15:43:13,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 15:43:13,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 15:43:13,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 15:43:13,428 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 15:43:13,428 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 15:43:13,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 15:43:13,429 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 15:43:13,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 15:43:13,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 15:43:13,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 15:43:13,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 15:43:13,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 15:43:13,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 15:43:13,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 15:43:13,432 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 15:43:13,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 15:43:13,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 15:43:13,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 15:43:13,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 15:43:13,433 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_04f107da-21c4-4608-8d8d-1baeb25fb3d5/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_04f107da-21c4-4608-8d8d-1baeb25fb3d5/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 ! call(reach_error())) ) 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 15:43:13,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 15:43:13,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 15:43:13,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 15:43:13,745 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 15:43:13,746 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 15:43:13,748 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/recursive/MultCommutative-2.c [2021-11-19 15:43:13,820 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/data/45d468753/bbeed38df6e043cda63f2bad7e8ab131/FLAG807b8c7f7 [2021-11-19 15:43:14,356 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 15:43:14,357 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/sv-benchmarks/c/recursive/MultCommutative-2.c [2021-11-19 15:43:14,365 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/data/45d468753/bbeed38df6e043cda63f2bad7e8ab131/FLAG807b8c7f7 [2021-11-19 15:43:14,736 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/data/45d468753/bbeed38df6e043cda63f2bad7e8ab131 [2021-11-19 15:43:14,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 15:43:14,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 15:43:14,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 15:43:14,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 15:43:14,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 15:43:14,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:43:14" (1/1) ... [2021-11-19 15:43:14,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b44242a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:14, skipping insertion in model container [2021-11-19 15:43:14,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:43:14" (1/1) ... [2021-11-19 15:43:14,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 15:43:14,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 15:43:14,968 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_04f107da-21c4-4608-8d8d-1baeb25fb3d5/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2021-11-19 15:43:14,972 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 15:43:14,981 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 15:43:14,999 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_04f107da-21c4-4608-8d8d-1baeb25fb3d5/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2021-11-19 15:43:15,000 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 15:43:15,016 INFO L208 MainTranslator]: Completed translation [2021-11-19 15:43:15,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15 WrapperNode [2021-11-19 15:43:15,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 15:43:15,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 15:43:15,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 15:43:15,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 15:43:15,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (1/1) ... [2021-11-19 15:43:15,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (1/1) ... [2021-11-19 15:43:15,055 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2021-11-19 15:43:15,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 15:43:15,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 15:43:15,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 15:43:15,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 15:43:15,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (1/1) ... [2021-11-19 15:43:15,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (1/1) ... [2021-11-19 15:43:15,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (1/1) ... [2021-11-19 15:43:15,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (1/1) ... [2021-11-19 15:43:15,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (1/1) ... [2021-11-19 15:43:15,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (1/1) ... [2021-11-19 15:43:15,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (1/1) ... [2021-11-19 15:43:15,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 15:43:15,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 15:43:15,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 15:43:15,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 15:43:15,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (1/1) ... [2021-11-19 15:43:15,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 15:43:15,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:43:15,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 15:43:15,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 15:43:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 15:43:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2021-11-19 15:43:15,178 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2021-11-19 15:43:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 15:43:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 15:43:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 15:43:15,248 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 15:43:15,250 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 15:43:15,375 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 15:43:15,389 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 15:43:15,390 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 15:43:15,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:43:15 BoogieIcfgContainer [2021-11-19 15:43:15,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 15:43:15,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 15:43:15,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 15:43:15,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 15:43:15,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 03:43:14" (1/3) ... [2021-11-19 15:43:15,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a55c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:43:15, skipping insertion in model container [2021-11-19 15:43:15,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:43:15" (2/3) ... [2021-11-19 15:43:15,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a55c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:43:15, skipping insertion in model container [2021-11-19 15:43:15,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:43:15" (3/3) ... [2021-11-19 15:43:15,403 INFO L111 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2021-11-19 15:43:15,410 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 15:43:15,410 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 15:43:15,472 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 15:43:15,480 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-19 15:43:15,481 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 15:43:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 15:43:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-19 15:43:15,505 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:15,506 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:43:15,506 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash 647179642, now seen corresponding path program 1 times [2021-11-19 15:43:15,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:15,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944072387] [2021-11-19 15:43:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:15,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 15:43:15,758 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:15,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944072387] [2021-11-19 15:43:15,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944072387] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:43:15,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:43:15,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-19 15:43:15,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764274377] [2021-11-19 15:43:15,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:43:15,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 15:43:15,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:43:15,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 15:43:15,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-19 15:43:15,819 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 15:43:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:43:16,028 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2021-11-19 15:43:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 15:43:16,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-11-19 15:43:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:43:16,043 INFO L225 Difference]: With dead ends: 39 [2021-11-19 15:43:16,044 INFO L226 Difference]: Without dead ends: 27 [2021-11-19 15:43:16,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-19 15:43:16,053 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:43:16,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 126 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:43:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-19 15:43:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2021-11-19 15:43:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-11-19 15:43:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2021-11-19 15:43:16,095 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 19 [2021-11-19 15:43:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:43:16,096 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2021-11-19 15:43:16,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 15:43:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2021-11-19 15:43:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 15:43:16,099 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:16,099 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 15:43:16,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 15:43:16,100 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:16,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1580415186, now seen corresponding path program 1 times [2021-11-19 15:43:16,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:16,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118036888] [2021-11-19 15:43:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:16,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-19 15:43:16,291 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:16,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118036888] [2021-11-19 15:43:16,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118036888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:43:16,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:43:16,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-19 15:43:16,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139583437] [2021-11-19 15:43:16,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:43:16,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 15:43:16,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:43:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 15:43:16,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-19 15:43:16,297 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 15:43:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:43:16,406 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2021-11-19 15:43:16,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 15:43:16,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-11-19 15:43:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:43:16,408 INFO L225 Difference]: With dead ends: 36 [2021-11-19 15:43:16,409 INFO L226 Difference]: Without dead ends: 32 [2021-11-19 15:43:16,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-19 15:43:16,411 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:43:16,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:43:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-19 15:43:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2021-11-19 15:43:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2021-11-19 15:43:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2021-11-19 15:43:16,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 25 [2021-11-19 15:43:16,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:43:16,434 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2021-11-19 15:43:16,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 15:43:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2021-11-19 15:43:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-19 15:43:16,443 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:16,443 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:43:16,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 15:43:16,445 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash -124187766, now seen corresponding path program 1 times [2021-11-19 15:43:16,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:16,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63005886] [2021-11-19 15:43:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:16,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-19 15:43:16,582 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:16,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63005886] [2021-11-19 15:43:16,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63005886] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:43:16,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132869464] [2021-11-19 15:43:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:16,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:16,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:43:16,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:43:16,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 15:43:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:16,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 15:43:16,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:43:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-19 15:43:16,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:43:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-19 15:43:16,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132869464] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:43:16,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1412983053] [2021-11-19 15:43:16,960 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:43:16,960 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:43:16,966 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:43:16,969 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:43:16,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-11-19 15:43:16,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087859397] [2021-11-19 15:43:16,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:43:16,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 15:43:16,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:43:16,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 15:43:16,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:43:16,973 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 15:43:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:43:17,048 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2021-11-19 15:43:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 15:43:17,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2021-11-19 15:43:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:43:17,051 INFO L225 Difference]: With dead ends: 32 [2021-11-19 15:43:17,051 INFO L226 Difference]: Without dead ends: 24 [2021-11-19 15:43:17,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-19 15:43:17,054 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:43:17,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:43:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-19 15:43:17,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2021-11-19 15:43:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-19 15:43:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2021-11-19 15:43:17,064 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 26 [2021-11-19 15:43:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:43:17,065 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-11-19 15:43:17,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 15:43:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2021-11-19 15:43:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-19 15:43:17,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:17,068 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:43:17,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 15:43:17,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:17,285 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:17,286 INFO L85 PathProgramCache]: Analyzing trace with hash -590605896, now seen corresponding path program 2 times [2021-11-19 15:43:17,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:17,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492899247] [2021-11-19 15:43:17,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:17,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-19 15:43:17,363 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:17,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492899247] [2021-11-19 15:43:17,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492899247] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 15:43:17,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 15:43:17,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 15:43:17,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883718105] [2021-11-19 15:43:17,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 15:43:17,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 15:43:17,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:43:17,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 15:43:17,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 15:43:17,367 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-19 15:43:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:43:17,434 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2021-11-19 15:43:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 15:43:17,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2021-11-19 15:43:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:43:17,440 INFO L225 Difference]: With dead ends: 25 [2021-11-19 15:43:17,440 INFO L226 Difference]: Without dead ends: 21 [2021-11-19 15:43:17,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 15:43:17,452 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 15:43:17,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 15:43:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-19 15:43:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-19 15:43:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-19 15:43:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-11-19 15:43:17,474 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 26 [2021-11-19 15:43:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:43:17,475 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-11-19 15:43:17,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-19 15:43:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2021-11-19 15:43:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-19 15:43:17,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:17,477 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:43:17,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-19 15:43:17,478 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:17,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:17,478 INFO L85 PathProgramCache]: Analyzing trace with hash 132154764, now seen corresponding path program 3 times [2021-11-19 15:43:17,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:17,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610848599] [2021-11-19 15:43:17,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:17,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-19 15:43:17,986 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:17,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610848599] [2021-11-19 15:43:17,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610848599] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:43:17,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189374941] [2021-11-19 15:43:17,987 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 15:43:17,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:17,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:43:17,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:43:18,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-19 15:43:18,058 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 15:43:18,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:43:18,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-19 15:43:18,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:43:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-19 15:43:18,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:43:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-19 15:43:20,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189374941] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:43:20,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [602030431] [2021-11-19 15:43:20,024 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:43:20,024 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:43:20,026 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:43:20,030 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:43:20,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 14] total 35 [2021-11-19 15:43:20,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811266037] [2021-11-19 15:43:20,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:43:20,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-19 15:43:20,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:43:20,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-19 15:43:20,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2021-11-19 15:43:20,036 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 35 states, 32 states have (on average 1.53125) internal successors, (49), 24 states have internal predecessors, (49), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2021-11-19 15:43:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:43:20,872 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2021-11-19 15:43:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-19 15:43:20,873 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 1.53125) internal successors, (49), 24 states have internal predecessors, (49), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) Word has length 33 [2021-11-19 15:43:20,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:43:20,875 INFO L225 Difference]: With dead ends: 39 [2021-11-19 15:43:20,875 INFO L226 Difference]: Without dead ends: 35 [2021-11-19 15:43:20,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=293, Invalid=1777, Unknown=0, NotChecked=0, Total=2070 [2021-11-19 15:43:20,878 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 15:43:20,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 159 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 15:43:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-19 15:43:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2021-11-19 15:43:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2021-11-19 15:43:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-11-19 15:43:20,889 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 33 [2021-11-19 15:43:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:43:20,889 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-11-19 15:43:20,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 1.53125) internal successors, (49), 24 states have internal predecessors, (49), 9 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2021-11-19 15:43:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-11-19 15:43:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-19 15:43:20,892 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:20,892 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:43:20,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-19 15:43:21,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:21,105 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash 169705396, now seen corresponding path program 1 times [2021-11-19 15:43:21,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:21,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961932509] [2021-11-19 15:43:21,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:21,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-19 15:43:21,158 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:21,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961932509] [2021-11-19 15:43:21,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961932509] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:43:21,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410996515] [2021-11-19 15:43:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:21,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:21,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:43:21,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:43:21,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-19 15:43:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:21,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 15:43:21,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:43:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-19 15:43:21,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:43:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-19 15:43:21,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410996515] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:43:21,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [426212802] [2021-11-19 15:43:21,561 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-11-19 15:43:21,561 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:43:21,562 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:43:21,563 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:43:21,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2021-11-19 15:43:21,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908278064] [2021-11-19 15:43:21,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:43:21,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-19 15:43:21,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:43:21,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-19 15:43:21,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-19 15:43:21,566 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-19 15:43:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:43:21,676 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2021-11-19 15:43:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 15:43:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 39 [2021-11-19 15:43:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:43:21,679 INFO L225 Difference]: With dead ends: 56 [2021-11-19 15:43:21,680 INFO L226 Difference]: Without dead ends: 24 [2021-11-19 15:43:21,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-11-19 15:43:21,685 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:43:21,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 72 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 15:43:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-19 15:43:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-11-19 15:43:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-19 15:43:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-11-19 15:43:21,698 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 39 [2021-11-19 15:43:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:43:21,699 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-11-19 15:43:21,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-19 15:43:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-11-19 15:43:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-19 15:43:21,706 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:21,706 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:43:21,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-19 15:43:21,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-19 15:43:21,921 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:21,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash 735115528, now seen corresponding path program 4 times [2021-11-19 15:43:21,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:21,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548576677] [2021-11-19 15:43:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:21,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-19 15:43:22,345 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:22,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548576677] [2021-11-19 15:43:22,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548576677] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:43:22,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122416274] [2021-11-19 15:43:22,346 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 15:43:22,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:22,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:43:22,350 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:43:22,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 15:43:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:22,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-19 15:43:22,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:43:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-19 15:43:23,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:43:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-19 15:43:24,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122416274] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:43:24,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [113415841] [2021-11-19 15:43:24,849 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:43:24,849 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:43:24,850 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:43:24,851 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:43:24,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 22] total 48 [2021-11-19 15:43:24,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471884385] [2021-11-19 15:43:24,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:43:24,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-19 15:43:24,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:43:24,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-19 15:43:24,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2063, Unknown=0, NotChecked=0, Total=2256 [2021-11-19 15:43:24,855 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 34 states have internal predecessors, (66), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-19 15:43:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:43:26,118 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2021-11-19 15:43:26,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-19 15:43:26,119 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 34 states have internal predecessors, (66), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) Word has length 40 [2021-11-19 15:43:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:43:26,120 INFO L225 Difference]: With dead ends: 48 [2021-11-19 15:43:26,120 INFO L226 Difference]: Without dead ends: 40 [2021-11-19 15:43:26,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=526, Invalid=3764, Unknown=0, NotChecked=0, Total=4290 [2021-11-19 15:43:26,124 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 15:43:26,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 211 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-19 15:43:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-11-19 15:43:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2021-11-19 15:43:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2021-11-19 15:43:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2021-11-19 15:43:26,132 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 40 [2021-11-19 15:43:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:43:26,133 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2021-11-19 15:43:26,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 34 states have internal predecessors, (66), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-19 15:43:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2021-11-19 15:43:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-19 15:43:26,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:26,139 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:43:26,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-19 15:43:26,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:26,365 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:26,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:26,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1490504886, now seen corresponding path program 5 times [2021-11-19 15:43:26,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:26,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584390372] [2021-11-19 15:43:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:26,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-19 15:43:27,145 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:27,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584390372] [2021-11-19 15:43:27,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584390372] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:43:27,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465479147] [2021-11-19 15:43:27,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 15:43:27,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:27,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:43:27,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:43:27,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-19 15:43:27,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-11-19 15:43:27,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:43:27,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 85 conjunts are in the unsatisfiable core [2021-11-19 15:43:27,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:43:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 3 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-19 15:43:28,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:43:34,182 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_mult_#in~m|) (forall ((v_mult_~n_BEFORE_CALL_20 Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_20_90| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121| Int)) (let ((.cse3 (* 3 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145|))) (let ((.cse1 (* 3 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121|)) (.cse0 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145| |c_mult_#res| .cse3)) (.cse2 (div (+ (- 1) (* v_mult_~n_BEFORE_CALL_20 2) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145| (- 6)) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145| (- 2))) (- 3))) (.cse4 (div (+ (- 1) (* v_mult_~n_BEFORE_CALL_20 (- 2)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145| 6) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145| 2)) 3))) (or (< .cse0 .cse1) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145| 1) .cse2) (<= .cse2 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121| 1)) (< (* 3 |aux_div_v_mult_#in~n_BEFORE_CALL_20_90|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145| .cse3)) (< (+ .cse4 1) |aux_div_v_mult_#in~n_BEFORE_CALL_20_90|) (<= (+ .cse1 3) .cse0) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_121_145| 0) (< .cse2 (+ 2 .cse4)))))) (forall ((v_mult_~n_BEFORE_CALL_20 Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_20_90| Int)) (let ((.cse6 (div (+ (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163| 6) (- 1) (* v_mult_~n_BEFORE_CALL_20 (- 2)) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163| (- 2)) (* |c_mult_#res| (- 2))) 3))) (let ((.cse5 (div (+ (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163| (- 6)) (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163| 2) (* v_mult_~n_BEFORE_CALL_20 2) (* |c_mult_#res| 2)) (- 3))) (.cse8 (* 3 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163|)) (.cse7 (+ .cse6 1))) (or (< .cse5 (+ 2 .cse6)) (<= 3 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163|) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163| .cse7) (< (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163| |c_mult_#res| (* 3 |aux_div_v_mult_#in~n_BEFORE_CALL_20_90|)) .cse8) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163| 0) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109| 1) .cse5) (< .cse8 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109_163| |c_mult_#res| (* 3 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_20_90_109|))) (< .cse7 |aux_div_v_mult_#in~n_BEFORE_CALL_20_90|))))) (<= |c_mult_#in~m| 0)) is different from false [2021-11-19 15:43:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 20 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 12 not checked. [2021-11-19 15:43:34,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465479147] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:43:34,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [726078195] [2021-11-19 15:43:34,886 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:43:34,886 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:43:34,886 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:43:34,888 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:43:34,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 25] total 58 [2021-11-19 15:43:34,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175586086] [2021-11-19 15:43:34,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:43:34,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-11-19 15:43:34,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:43:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-11-19 15:43:34,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2998, Unknown=1, NotChecked=110, Total=3306 [2021-11-19 15:43:34,892 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 58 states, 53 states have (on average 1.509433962264151) internal successors, (80), 40 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (19), 18 states have call predecessors, (19), 15 states have call successors, (19) [2021-11-19 15:43:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:43:37,146 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2021-11-19 15:43:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-19 15:43:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 53 states have (on average 1.509433962264151) internal successors, (80), 40 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (19), 18 states have call predecessors, (19), 15 states have call successors, (19) Word has length 54 [2021-11-19 15:43:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:43:37,148 INFO L225 Difference]: With dead ends: 60 [2021-11-19 15:43:37,148 INFO L226 Difference]: Without dead ends: 49 [2021-11-19 15:43:37,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=736, Invalid=5909, Unknown=1, NotChecked=160, Total=6806 [2021-11-19 15:43:37,151 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 60 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-19 15:43:37,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 263 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1122 Invalid, 0 Unknown, 40 Unchecked, 0.9s Time] [2021-11-19 15:43:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-19 15:43:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2021-11-19 15:43:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2021-11-19 15:43:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2021-11-19 15:43:37,159 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 54 [2021-11-19 15:43:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:43:37,159 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-11-19 15:43:37,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 53 states have (on average 1.509433962264151) internal successors, (80), 40 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (19), 18 states have call predecessors, (19), 15 states have call successors, (19) [2021-11-19 15:43:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2021-11-19 15:43:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-19 15:43:37,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:37,161 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:43:37,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-19 15:43:37,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:37,385 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash -140737028, now seen corresponding path program 6 times [2021-11-19 15:43:37,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:37,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204747069] [2021-11-19 15:43:37,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:37,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-19 15:43:37,894 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:37,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204747069] [2021-11-19 15:43:37,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204747069] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:43:37,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013648446] [2021-11-19 15:43:37,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 15:43:37,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:37,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:43:37,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:43:37,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 15:43:37,952 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 15:43:37,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:43:37,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-19 15:43:37,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:43:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-19 15:43:38,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:43:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-19 15:43:40,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013648446] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:43:40,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [564438156] [2021-11-19 15:43:40,299 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:43:40,300 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:43:40,300 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:43:40,300 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:43:40,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 23] total 56 [2021-11-19 15:43:40,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434635781] [2021-11-19 15:43:40,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:43:40,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-11-19 15:43:40,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:43:40,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-11-19 15:43:40,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2867, Unknown=0, NotChecked=0, Total=3080 [2021-11-19 15:43:40,304 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 56 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 38 states have internal predecessors, (79), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (18), 18 states have call predecessors, (18), 14 states have call successors, (18) [2021-11-19 15:43:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:43:41,687 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2021-11-19 15:43:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-19 15:43:41,687 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 38 states have internal predecessors, (79), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (18), 18 states have call predecessors, (18), 14 states have call successors, (18) Word has length 47 [2021-11-19 15:43:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:43:41,688 INFO L225 Difference]: With dead ends: 54 [2021-11-19 15:43:41,688 INFO L226 Difference]: Without dead ends: 45 [2021-11-19 15:43:41,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=705, Invalid=5301, Unknown=0, NotChecked=0, Total=6006 [2021-11-19 15:43:41,692 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 63 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 15:43:41,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 203 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-19 15:43:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-19 15:43:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-11-19 15:43:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2021-11-19 15:43:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-11-19 15:43:41,699 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 47 [2021-11-19 15:43:41,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:43:41,699 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-11-19 15:43:41,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 38 states have internal predecessors, (79), 14 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (18), 18 states have call predecessors, (18), 14 states have call successors, (18) [2021-11-19 15:43:41,699 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2021-11-19 15:43:41,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-19 15:43:41,700 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:41,700 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:43:41,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-19 15:43:41,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:41,917 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash -87767316, now seen corresponding path program 7 times [2021-11-19 15:43:41,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:41,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250377276] [2021-11-19 15:43:41,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:41,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 4 proven. 138 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-19 15:43:42,552 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:42,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250377276] [2021-11-19 15:43:42,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250377276] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:43:42,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42541453] [2021-11-19 15:43:42,552 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 15:43:42,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:42,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:43:42,553 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:43:42,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-19 15:43:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:42,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 93 conjunts are in the unsatisfiable core [2021-11-19 15:43:42,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:43:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 32 proven. 80 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-19 15:43:43,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:43:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 8 proven. 134 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-19 15:43:47,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42541453] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:43:47,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316906899] [2021-11-19 15:43:47,162 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:43:47,162 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:43:47,162 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:43:47,162 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:43:47,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 29] total 73 [2021-11-19 15:43:47,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214269821] [2021-11-19 15:43:47,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:43:47,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2021-11-19 15:43:47,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:43:47,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-11-19 15:43:47,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=5006, Unknown=0, NotChecked=0, Total=5256 [2021-11-19 15:43:47,174 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 73 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 49 states have internal predecessors, (107), 18 states have call successors, (18), 1 states have call predecessors, (18), 20 states have return successors, (24), 24 states have call predecessors, (24), 18 states have call successors, (24) [2021-11-19 15:43:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:43:50,149 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2021-11-19 15:43:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-19 15:43:50,150 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 49 states have internal predecessors, (107), 18 states have call successors, (18), 1 states have call predecessors, (18), 20 states have return successors, (24), 24 states have call predecessors, (24), 18 states have call successors, (24) Word has length 61 [2021-11-19 15:43:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:43:50,153 INFO L225 Difference]: With dead ends: 89 [2021-11-19 15:43:50,153 INFO L226 Difference]: Without dead ends: 81 [2021-11-19 15:43:50,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1026, Invalid=9894, Unknown=0, NotChecked=0, Total=10920 [2021-11-19 15:43:50,158 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 83 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-19 15:43:50,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 548 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-19 15:43:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-19 15:43:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2021-11-19 15:43:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 9 states have call successors, (9), 4 states have call predecessors, (9), 12 states have return successors, (36), 16 states have call predecessors, (36), 9 states have call successors, (36) [2021-11-19 15:43:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2021-11-19 15:43:50,173 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 61 [2021-11-19 15:43:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:43:50,174 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2021-11-19 15:43:50,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 49 states have internal predecessors, (107), 18 states have call successors, (18), 1 states have call predecessors, (18), 20 states have return successors, (24), 24 states have call predecessors, (24), 18 states have call successors, (24) [2021-11-19 15:43:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2021-11-19 15:43:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-19 15:43:50,176 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:43:50,176 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:43:50,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-19 15:43:50,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:50,377 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:43:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:43:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash -943012406, now seen corresponding path program 8 times [2021-11-19 15:43:50,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:43:50,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90469103] [2021-11-19 15:43:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:43:50,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:43:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:43:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 347 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-19 15:43:51,600 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:43:51,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90469103] [2021-11-19 15:43:51,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90469103] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:43:51,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412877124] [2021-11-19 15:43:51,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 15:43:51,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:43:51,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:43:51,602 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:43:51,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-19 15:43:51,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2021-11-19 15:43:51,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:43:51,674 WARN L261 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 145 conjunts are in the unsatisfiable core [2021-11-19 15:43:51,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:43:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 197 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-11-19 15:43:53,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:44:19,941 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_mult_#in~n_BEFORE_CALL_59| Int)) (or (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_58_60| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| Int)) (let ((.cse5 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| 24) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_59| (- 12))) 6))) (let ((.cse2 (* 2 |c_mult_#in~n|)) (.cse0 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_59|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (* 6 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158|))) (.cse1 (* 6 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|)) (.cse4 (+ .cse5 1)) (.cse3 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (- 24)) (* |v_mult_#in~n_BEFORE_CALL_59| 12) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| 4)) (- 6)))) (and (< .cse0 (+ .cse1 6 .cse2)) (<= .cse3 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_58_60| 1)) (<= (+ .cse1 .cse2) .cse0) (<= (+ (* 6 |aux_div_v_mult_#in~n_BEFORE_CALL_58_60|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|) .cse1) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| .cse4) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|) (< .cse4 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158|) (<= (+ .cse5 2) .cse3))))) (and (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_58_60| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| Int)) (let ((.cse6 (* 6 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|))) (let ((.cse8 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_59| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 24)) 6)) (.cse10 (* 2 |v_mult_#in~n_BEFORE_CALL_59|)) (.cse11 (* 6 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134|)) (.cse9 (+ |c_mult_#res| .cse6 |c_mult_#in~n|)) (.cse7 (div (+ (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 4) (- 1) (* |v_mult_#in~n_BEFORE_CALL_59| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| (- 24))) (- 6)))) (or (< .cse6 (+ (* 6 |aux_div_v_mult_#in~n_BEFORE_CALL_58_60|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|)) (< .cse7 (+ .cse8 2)) (< .cse9 (+ .cse10 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| .cse11)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 0) (< (+ .cse8 1) |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|) (<= .cse7 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134| 1)) (<= (+ .cse10 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 6 .cse11) .cse9) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_58_60| 1) .cse7))))) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_58_60| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| Int)) (let ((.cse13 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| 24) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_59| (- 12))) 6))) (let ((.cse12 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (- 24)) (* |v_mult_#in~n_BEFORE_CALL_59| 12) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| 4)) (- 6))) (.cse14 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_59|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (* 6 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158|))) (.cse15 (* 6 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|)) (.cse16 (+ .cse13 1))) (or (< .cse12 (+ .cse13 2)) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_58_60| 1) .cse12) (< .cse14 (+ |c_mult_#res| .cse15 |c_mult_#in~n|)) (< .cse16 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|) (<= (+ |c_mult_#res| .cse15 6 |c_mult_#in~n|) .cse14) (< .cse15 (+ (* 6 |aux_div_v_mult_#in~n_BEFORE_CALL_58_60|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158| .cse16) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| 0)))))) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_58_60| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| Int)) (let ((.cse22 (* 6 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|))) (let ((.cse21 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_59| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 24)) 6)) (.cse17 (div (+ (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 4) (- 1) (* |v_mult_#in~n_BEFORE_CALL_59| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| (- 24))) (- 6))) (.cse20 (+ .cse22 (* 2 |c_mult_#in~n|))) (.cse18 (* 2 |v_mult_#in~n_BEFORE_CALL_59|)) (.cse19 (* 6 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134|))) (and (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134| 1) .cse17) (<= (+ .cse18 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| .cse19) .cse20) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|) (<= (+ .cse21 2) .cse17) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| (+ .cse21 1)) (<= .cse17 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_58_60| 1)) (<= (+ (* 6 |aux_div_v_mult_#in~n_BEFORE_CALL_58_60|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|) .cse22) (< .cse20 (+ .cse18 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 6 .cse19)))))))) (<= 1 |c_mult_#in~m|) (<= |c_mult_#in~m| 1)) is different from false [2021-11-19 15:44:27,642 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_mult_#in~m|) (forall ((|v_mult_#in~n_BEFORE_CALL_59| Int)) (or (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_58_60| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| Int)) (let ((.cse5 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| 24) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_59| (- 12))) 6))) (let ((.cse2 (* 2 |c_mult_#in~n|)) (.cse0 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_59|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (* 6 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158|))) (.cse1 (* 6 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|)) (.cse4 (+ .cse5 1)) (.cse3 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (- 24)) (* |v_mult_#in~n_BEFORE_CALL_59| 12) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| 4)) (- 6)))) (and (< .cse0 (+ .cse1 6 .cse2)) (<= .cse3 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_58_60| 1)) (<= (+ .cse1 .cse2) .cse0) (<= (+ (* 6 |aux_div_v_mult_#in~n_BEFORE_CALL_58_60|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|) .cse1) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| .cse4) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|) (< .cse4 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158|) (<= (+ .cse5 2) .cse3))))) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_58_60| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| Int)) (let ((.cse11 (* 6 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|))) (let ((.cse10 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_59| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 24)) 6)) (.cse6 (div (+ (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 4) (- 1) (* |v_mult_#in~n_BEFORE_CALL_59| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| (- 24))) (- 6))) (.cse9 (+ .cse11 (* 2 |c_mult_#in~n|))) (.cse7 (* 2 |v_mult_#in~n_BEFORE_CALL_59|)) (.cse8 (* 6 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134|))) (and (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134| 1) .cse6) (<= (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| .cse8) .cse9) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|) (<= (+ .cse10 2) .cse6) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| (+ .cse10 1)) (<= .cse6 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_58_60| 1)) (<= (+ (* 6 |aux_div_v_mult_#in~n_BEFORE_CALL_58_60|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|) .cse11) (< .cse9 (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 6 .cse8)))))) (and (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_58_60| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| Int)) (let ((.cse13 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| 24) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_59| (- 12))) 6))) (let ((.cse12 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (- 24)) (* |v_mult_#in~n_BEFORE_CALL_59| 12) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| 4)) (- 6))) (.cse16 (+ .cse13 1)) (.cse15 (* 6 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|)) (.cse14 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_59|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| (* 6 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158|)))) (or (< .cse12 (+ .cse13 2)) (< .cse14 (+ .cse15 |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n)) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_58_60| 1) .cse12) (< .cse16 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|) (< .cse15 (+ (* 6 |aux_div_v_mult_#in~n_BEFORE_CALL_58_60|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166|)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158| .cse16) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_158_166| 0) (<= (+ .cse15 6 |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n) .cse14))))) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_58_60| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| Int)) (let ((.cse17 (* 6 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|))) (let ((.cse19 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_59| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 24)) 6)) (.cse18 (div (+ (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 4) (- 1) (* |v_mult_#in~n_BEFORE_CALL_59| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| (- 24))) (- 6))) (.cse22 (+ .cse17 |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n)) (.cse20 (* 2 |v_mult_#in~n_BEFORE_CALL_59|)) (.cse21 (* 6 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134|))) (or (< .cse17 (+ (* 6 |aux_div_v_mult_#in~n_BEFORE_CALL_58_60|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|)) (< .cse18 (+ .cse19 2)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 0) (< (+ .cse19 1) |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176|) (<= (+ .cse20 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| 6 .cse21) .cse22) (<= .cse18 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134| 1)) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_58_60| 1) .cse18) (< .cse22 (+ .cse20 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_58_60_134_176| .cse21))))))))) (<= |c_mult_#in~m| 1)) is different from false [2021-11-19 15:44:55,931 WARN L227 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 15:44:56,317 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: not dual finite connective [2021-11-19 15:44:56,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1767232810] [2021-11-19 15:44:56,319 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:44:56,319 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:44:56,319 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:44:56,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 15:44:56,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2021-11-19 15:44:56,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386706622] [2021-11-19 15:44:56,321 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 15:44:56,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-19 15:44:56,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:44:56,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-19 15:44:56,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7169, Unknown=12, NotChecked=342, Total=7832 [2021-11-19 15:44:56,324 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 41 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 29 states have internal predecessors, (58), 11 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-19 15:44:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:44:58,847 INFO L93 Difference]: Finished difference Result 80 states and 113 transitions. [2021-11-19 15:44:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-19 15:44:58,849 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 29 states have internal predecessors, (58), 11 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) Word has length 89 [2021-11-19 15:44:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:44:58,851 INFO L225 Difference]: With dead ends: 80 [2021-11-19 15:44:58,851 INFO L226 Difference]: Without dead ends: 76 [2021-11-19 15:44:58,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=853, Invalid=9855, Unknown=12, NotChecked=410, Total=11130 [2021-11-19 15:44:58,856 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 122 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-19 15:44:58,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 472 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-19 15:44:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-19 15:44:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2021-11-19 15:44:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 10 states have call successors, (10), 4 states have call predecessors, (10), 13 states have return successors, (44), 18 states have call predecessors, (44), 10 states have call successors, (44) [2021-11-19 15:44:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 106 transitions. [2021-11-19 15:44:58,871 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 106 transitions. Word has length 89 [2021-11-19 15:44:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:44:58,872 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 106 transitions. [2021-11-19 15:44:58,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 29 states have internal predecessors, (58), 11 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-19 15:44:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 106 transitions. [2021-11-19 15:44:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-19 15:44:58,873 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:44:58,874 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:44:58,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-19 15:44:59,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-19 15:44:59,101 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:44:59,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:44:59,101 INFO L85 PathProgramCache]: Analyzing trace with hash 834620298, now seen corresponding path program 9 times [2021-11-19 15:44:59,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:44:59,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647287863] [2021-11-19 15:44:59,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:44:59,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:44:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:44:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 137 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-19 15:44:59,940 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:44:59,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647287863] [2021-11-19 15:44:59,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647287863] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:44:59,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860867978] [2021-11-19 15:44:59,941 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 15:44:59,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:44:59,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:44:59,964 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:44:59,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-19 15:45:00,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 15:45:00,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:45:00,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-19 15:45:00,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:45:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-11-19 15:45:01,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:45:07,364 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_mult_#in~m|) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_72_90| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163| Int) (v_mult_~n_BEFORE_CALL_72 Int)) (let ((.cse3 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163| (- 2)) (* v_mult_~n_BEFORE_CALL_72 (- 2)) (* |c_mult_#res| (- 2)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163| 8)) 4))) (let ((.cse1 (* 4 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163|)) (.cse2 (+ .cse3 1)) (.cse0 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163| 2) (* v_mult_~n_BEFORE_CALL_72 2) (* |c_mult_#res| 2) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163| (- 8))) (- 4)))) (or (<= 4 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163|) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163| 0) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109| 1) .cse0) (< (+ |c_mult_#res| (* 4 |aux_div_v_mult_#in~n_BEFORE_CALL_72_90|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163|) .cse1) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163| .cse2) (< .cse1 (+ |c_mult_#res| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_163| (* 4 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109|))) (< .cse2 |aux_div_v_mult_#in~n_BEFORE_CALL_72_90|) (< .cse0 (+ .cse3 2)))))) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_72_90| Int) (v_mult_~n_BEFORE_CALL_72 Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135| Int)) (let ((.cse5 (+ (* 4 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135|)) (.cse4 (div (+ (- 1) (* v_mult_~n_BEFORE_CALL_72 2) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135| (- 2)) (* |c_mult_#res| 2) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135| (- 8))) (- 4))) (.cse6 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135| 8) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135| 2) (* v_mult_~n_BEFORE_CALL_72 (- 2)) (* |c_mult_#res| (- 2))) 4))) (or (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109| 1) .cse4) (< (+ |c_mult_#res| (* 4 |aux_div_v_mult_#in~n_BEFORE_CALL_72_90|)) .cse5) (<= .cse4 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135| 1)) (< (+ .cse6 1) |aux_div_v_mult_#in~n_BEFORE_CALL_72_90|) (<= 4 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135|) (< .cse5 (+ |c_mult_#res| (* 4 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109|))) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_72_90_109_135| 0) (< .cse4 (+ .cse6 2))))) (<= |c_mult_#in~m| 0)) is different from false [2021-11-19 15:45:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 23 proven. 103 refuted. 0 times theorem prover too weak. 30 trivial. 14 not checked. [2021-11-19 15:45:07,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860867978] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:45:07,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1889527881] [2021-11-19 15:45:07,890 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:45:07,890 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:45:07,890 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:45:07,891 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:45:07,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18, 28] total 65 [2021-11-19 15:45:07,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093957287] [2021-11-19 15:45:07,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:45:07,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-11-19 15:45:07,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:45:07,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-11-19 15:45:07,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3809, Unknown=1, NotChecked=124, Total=4160 [2021-11-19 15:45:07,895 INFO L87 Difference]: Start difference. First operand 72 states and 106 transitions. Second operand has 65 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 44 states have internal predecessors, (91), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) [2021-11-19 15:45:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:45:10,106 INFO L93 Difference]: Finished difference Result 91 states and 131 transitions. [2021-11-19 15:45:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-19 15:45:10,106 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 44 states have internal predecessors, (91), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) Word has length 61 [2021-11-19 15:45:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:45:10,108 INFO L225 Difference]: With dead ends: 91 [2021-11-19 15:45:10,108 INFO L226 Difference]: Without dead ends: 84 [2021-11-19 15:45:10,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=761, Invalid=6552, Unknown=1, NotChecked=168, Total=7482 [2021-11-19 15:45:10,110 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 69 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-19 15:45:10,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 394 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1373 Invalid, 0 Unknown, 47 Unchecked, 0.9s Time] [2021-11-19 15:45:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-19 15:45:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2021-11-19 15:45:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 10 states have call successors, (10), 4 states have call predecessors, (10), 13 states have return successors, (39), 18 states have call predecessors, (39), 10 states have call successors, (39) [2021-11-19 15:45:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2021-11-19 15:45:10,124 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 61 [2021-11-19 15:45:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:45:10,125 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2021-11-19 15:45:10,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 44 states have internal predecessors, (91), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (22), 21 states have call predecessors, (22), 17 states have call successors, (22) [2021-11-19 15:45:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2021-11-19 15:45:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-19 15:45:10,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:45:10,127 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:45:10,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-19 15:45:10,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-19 15:45:10,341 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:45:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:45:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash -335813798, now seen corresponding path program 10 times [2021-11-19 15:45:10,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:45:10,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15476646] [2021-11-19 15:45:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:45:10,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:45:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:45:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-19 15:45:11,665 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:45:11,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15476646] [2021-11-19 15:45:11,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15476646] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:45:11,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531621184] [2021-11-19 15:45:11,666 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 15:45:11,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:45:11,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:45:11,667 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:45:11,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-19 15:45:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:45:11,761 WARN L261 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 121 conjunts are in the unsatisfiable core [2021-11-19 15:45:11,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:45:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-11-19 15:45:13,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:45:19,878 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135| Int) (v_mult_~n_BEFORE_CALL_88 Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_88_112| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121| Int)) (let ((.cse4 (div (+ (- 1) (* v_mult_~n_BEFORE_CALL_88 (- 2)) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135| 2) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135| 12)) 6))) (let ((.cse2 (* 6 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135|)) (.cse1 (* 6 |aux_div_v_mult_#in~n_BEFORE_CALL_88_112|)) (.cse0 (div (+ (- 1) (* v_mult_~n_BEFORE_CALL_88 2) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135| (- 12)) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135| (- 2))) (- 6))) (.cse3 (+ .cse4 1))) (or (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135| 1) .cse0) (< .cse1 (+ |c_mult_#res| .cse2 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135|)) (< (* 6 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121|) (+ .cse2 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135|)) (<= (+ |c_mult_#res| 6 .cse2 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135|) .cse1) (< .cse3 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121|) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_112_121_135| 0) (< .cse0 (+ 2 .cse4)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_88_112| .cse3))))) (<= 0 |c_mult_#in~m|) (forall ((v_mult_~n_BEFORE_CALL_88 Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_88_78| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141| Int)) (let ((.cse9 (* 6 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141|))) (let ((.cse8 (div (+ (- 1) (* v_mult_~n_BEFORE_CALL_88 (- 2)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141| 12) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141| (- 2))) 6)) (.cse6 (+ |c_mult_#res| .cse9)) (.cse5 (* 6 |aux_div_v_mult_#in~n_BEFORE_CALL_88_78|)) (.cse7 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141| 2) (* v_mult_~n_BEFORE_CALL_88 2) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141| (- 12))) (- 6)))) (or (<= (+ .cse5 6 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141|) .cse6) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121| 1) .cse7) (< .cse7 (+ 2 .cse8)) (< (+ .cse8 1) |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141|) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141| 0) (< .cse6 (+ .cse5 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141|)) (<= .cse7 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_88_78| 1)) (< .cse9 (+ (* 6 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_88_78_121_141|)))))) (<= |c_mult_#in~m| 0)) is different from false [2021-11-19 15:45:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 29 proven. 187 refuted. 0 times theorem prover too weak. 47 trivial. 18 not checked. [2021-11-19 15:45:20,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531621184] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:45:20,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [981929833] [2021-11-19 15:45:20,465 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:45:20,465 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:45:20,465 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:45:20,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:45:20,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 22, 34] total 79 [2021-11-19 15:45:20,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910511341] [2021-11-19 15:45:20,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:45:20,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2021-11-19 15:45:20,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:45:20,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-11-19 15:45:20,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=5740, Unknown=1, NotChecked=152, Total=6162 [2021-11-19 15:45:20,471 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand has 79 states, 74 states have (on average 1.527027027027027) internal successors, (113), 52 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (28), 27 states have call predecessors, (28), 21 states have call successors, (28) [2021-11-19 15:45:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:45:23,667 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2021-11-19 15:45:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-19 15:45:23,667 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 74 states have (on average 1.527027027027027) internal successors, (113), 52 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (28), 27 states have call predecessors, (28), 21 states have call successors, (28) Word has length 75 [2021-11-19 15:45:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:45:23,669 INFO L225 Difference]: With dead ends: 94 [2021-11-19 15:45:23,669 INFO L226 Difference]: Without dead ends: 87 [2021-11-19 15:45:23,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2219 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1018, Invalid=9905, Unknown=1, NotChecked=206, Total=11130 [2021-11-19 15:45:23,672 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 157 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-19 15:45:23,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 622 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2043 Invalid, 0 Unknown, 50 Unchecked, 1.5s Time] [2021-11-19 15:45:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-19 15:45:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2021-11-19 15:45:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 9 states have call successors, (9), 4 states have call predecessors, (9), 13 states have return successors, (32), 17 states have call predecessors, (32), 9 states have call successors, (32) [2021-11-19 15:45:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2021-11-19 15:45:23,685 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 75 [2021-11-19 15:45:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:45:23,686 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2021-11-19 15:45:23,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 74 states have (on average 1.527027027027027) internal successors, (113), 52 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (28), 27 states have call predecessors, (28), 21 states have call successors, (28) [2021-11-19 15:45:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2021-11-19 15:45:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-19 15:45:23,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:45:23,688 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:45:23,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-19 15:45:23,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:45:23,909 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:45:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:45:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1392852054, now seen corresponding path program 11 times [2021-11-19 15:45:23,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:45:23,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567191159] [2021-11-19 15:45:23,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:45:23,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:45:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:45:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-11-19 15:45:24,950 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:45:24,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567191159] [2021-11-19 15:45:24,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567191159] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:45:24,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689800885] [2021-11-19 15:45:24,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 15:45:24,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:45:24,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:45:24,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:45:24,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-19 15:45:25,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-11-19 15:45:25,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:45:25,033 WARN L261 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 132 conjunts are in the unsatisfiable core [2021-11-19 15:45:25,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:45:27,074 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 15:45:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 20 proven. 174 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-11-19 15:45:27,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:45:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 33 proven. 259 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 15:45:33,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689800885] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:45:33,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [613545406] [2021-11-19 15:45:33,307 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:45:33,308 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:45:33,308 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:45:33,310 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:45:33,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 28, 40] total 90 [2021-11-19 15:45:33,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10732149] [2021-11-19 15:45:33,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:45:33,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2021-11-19 15:45:33,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:45:33,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-11-19 15:45:33,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=7635, Unknown=0, NotChecked=0, Total=8010 [2021-11-19 15:45:33,319 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 90 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 60 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (32), 30 states have call predecessors, (32), 24 states have call successors, (32) [2021-11-19 15:45:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:45:36,283 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2021-11-19 15:45:36,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-19 15:45:36,284 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 60 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (32), 30 states have call predecessors, (32), 24 states have call successors, (32) Word has length 82 [2021-11-19 15:45:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:45:36,285 INFO L225 Difference]: With dead ends: 95 [2021-11-19 15:45:36,286 INFO L226 Difference]: Without dead ends: 88 [2021-11-19 15:45:36,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 104 SyntacticMatches, 11 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3149 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1241, Invalid=12331, Unknown=0, NotChecked=0, Total=13572 [2021-11-19 15:45:36,288 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 81 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-19 15:45:36,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 677 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2223 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-19 15:45:36,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-19 15:45:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2021-11-19 15:45:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 14 states have return successors, (35), 18 states have call predecessors, (35), 9 states have call successors, (35) [2021-11-19 15:45:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2021-11-19 15:45:36,309 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 82 [2021-11-19 15:45:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:45:36,310 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2021-11-19 15:45:36,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 60 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (32), 30 states have call predecessors, (32), 24 states have call successors, (32) [2021-11-19 15:45:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2021-11-19 15:45:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-19 15:45:36,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:45:36,313 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 12, 12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:45:36,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-19 15:45:36,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:45:36,541 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:45:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:45:36,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1671238042, now seen corresponding path program 12 times [2021-11-19 15:45:36,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:45:36,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638622228] [2021-11-19 15:45:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:45:36,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:45:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:45:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 1 proven. 488 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-11-19 15:45:38,149 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:45:38,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638622228] [2021-11-19 15:45:38,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638622228] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:45:38,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060192932] [2021-11-19 15:45:38,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 15:45:38,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:45:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:45:38,152 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:45:38,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-19 15:45:38,268 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 15:45:38,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 15:45:38,272 WARN L261 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 169 conjunts are in the unsatisfiable core [2021-11-19 15:45:38,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:45:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 8 proven. 274 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2021-11-19 15:45:40,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:46:16,779 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse16 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse3 (+ .cse16 1)) (.cse2 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse1 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse0 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|))) (or (<= (+ .cse0 |c_mult_#res| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 8 |c_mult_#in~n|) .cse1) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse2) (< .cse3 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse5 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse4 (+ .cse5 1)) (.cse6 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse9 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse7 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse8 (* 2 |c_mult_#in~n|))) (and (< .cse4 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse5 2) .cse6) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse4) (<= (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse8) .cse9) (<= .cse6 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (< .cse9 (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse8 8)))))) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse14 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse10 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse15 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse13 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse14 (* 2 |c_mult_#in~n|))) (.cse11 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse12 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|))) (and (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse10) (<= (+ .cse11 .cse12) .cse13) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse14) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse15 2) .cse10) (<= .cse10 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse15 1)) (< .cse13 (+ .cse11 8 .cse12)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse3) (< .cse2 (+ .cse16 2)) (< .cse1 (+ .cse0 |c_mult_#res| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| |c_mult_#in~n|)))))) (<= 1 |c_mult_#in~m|) (<= |c_mult_#in~m| 1) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse27 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse19 (+ |c_mult_#res| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse27 |c_mult_#in~n|)) (.cse17 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse18 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse34 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse26 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (<= (+ .cse17 8 .cse18) .cse19) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse21 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse20 (+ .cse21 1)) (.cse22 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse25 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse23 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse24 (* 2 |c_mult_#in~n|))) (and (< .cse20 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse21 2) .cse22) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse20) (<= (+ .cse23 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse23 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse24) .cse25) (<= .cse22 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (< .cse25 (+ .cse23 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse24 8)))))) (<= .cse26 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse27)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse32 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse28 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse33 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse31 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse32 (* 2 |c_mult_#in~n|))) (.cse29 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse30 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|))) (and (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse28) (<= (+ .cse29 .cse30) .cse31) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse32) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse33 2) .cse28) (<= .cse28 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse33 1)) (< .cse31 (+ .cse29 8 .cse30)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (< .cse19 (+ .cse17 .cse18)) (< (+ .cse34 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (< .cse26 (+ .cse34 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse26)))))) is different from false [2021-11-19 15:46:23,804 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_mult_#in~m|) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse16 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse1 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse0 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse3 (+ .cse16 1)) (.cse2 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (or (<= (+ .cse0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| |c_mult_#t~ret5| 8 |c_mult_#in~n| c_mult_~n) .cse1) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse2) (< .cse3 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< .cse1 (+ .cse0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n)) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse5 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse4 (+ .cse5 1)) (.cse6 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse9 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse7 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse8 (* 2 |c_mult_#in~n|))) (and (< .cse4 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse5 2) .cse6) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse4) (<= (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse8) .cse9) (<= .cse6 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (< .cse9 (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse8 8)))))) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse14 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse10 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse15 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse13 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse14 (* 2 |c_mult_#in~n|))) (.cse11 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse12 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|))) (and (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse10) (<= (+ .cse11 .cse12) .cse13) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse14) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse15 2) .cse10) (<= .cse10 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse15 1)) (< .cse13 (+ .cse11 8 .cse12)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse3) (< .cse2 (+ .cse16 2)))))) (<= |c_mult_#in~m| 1) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse24 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse33 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse24 |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n)) (.cse31 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse32 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse34 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse23 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse18 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse17 (+ .cse18 1)) (.cse19 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse22 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse20 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse21 (* 2 |c_mult_#in~n|))) (and (< .cse17 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse18 2) .cse19) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse17) (<= (+ .cse20 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse20 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse21) .cse22) (<= .cse19 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (< .cse22 (+ .cse20 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse21 8)))))) (<= .cse23 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse24)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse29 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse25 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse30 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse28 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse29 (* 2 |c_mult_#in~n|))) (.cse26 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse27 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|))) (and (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse25) (<= (+ .cse26 .cse27) .cse28) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse29) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse30 2) .cse25) (<= .cse25 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse30 1)) (< .cse28 (+ .cse26 8 .cse27)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (<= (+ .cse31 8 .cse32) .cse33) (< .cse33 (+ .cse31 .cse32)) (< (+ .cse34 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (< .cse23 (+ .cse34 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse23)))))) is different from false [2021-11-19 15:46:57,286 WARN L227 SmtUtils]: Spent 18.11s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 15:48:32,438 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_mult_#in~m|) (forall ((|v_mult_#in~n_BEFORE_CALL_130| Int) (v_mult_~n_BEFORE_CALL_130 Int)) (or (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse4 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse2 (+ v_mult_~n_BEFORE_CALL_130 |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse4)) (.cse0 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse1 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse3 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse5 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8))) (and (<= (+ .cse0 .cse1) .cse2) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse3) (< .cse2 (+ .cse0 8 .cse1)) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse4) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse5 2) .cse3) (<= .cse3 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse5 1)) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse9 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse7 (+ .cse9 1)) (.cse6 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse8 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse11 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse10 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|)))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse6) (< .cse7 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse7) (< .cse6 (+ .cse9 2)) (< .cse10 (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse11)) (<= (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse11 8) .cse10))))) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse16 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse13 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse14 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse12 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse16)) (.cse17 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse15 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (< .cse12 (+ .cse13 .cse14)) (<= .cse15 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse16)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (< (+ .cse17 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (<= (+ .cse13 8 .cse14) .cse12) (< .cse15 (+ .cse17 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse15))))) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (and (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse28 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse19 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse20 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse18 (+ v_mult_~n_BEFORE_CALL_130 |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse28)) (.cse35 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse27 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (< .cse18 (+ .cse19 .cse20)) (<= (+ .cse19 8 .cse20) .cse18) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse22 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse21 (+ .cse22 1)) (.cse24 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse26 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse25 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse23 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (and (< .cse21 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse22 2) .cse23) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse21) (<= (+ .cse24 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (< .cse25 (+ .cse24 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse26 8)) (<= (+ .cse24 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse26) .cse25) (<= .cse23 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)))))) (<= .cse27 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse28)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse33 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse32 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse34 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse30 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse31 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse29 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse33))) (and (< .cse29 (+ .cse30 8 .cse31)) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse32) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse33) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse34 2) .cse32) (<= .cse32 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse34 1)) (<= (+ .cse30 .cse31) .cse29) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (< (+ .cse35 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (< .cse27 (+ .cse35 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse27))))) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse45 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse43 (+ .cse45 1)) (.cse42 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse44 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse52 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|)))) (or (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse37 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse36 (+ .cse37 1)) (.cse39 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse41 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse40 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse38 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (and (< .cse36 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse37 2) .cse38) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse36) (<= (+ .cse39 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (< .cse40 (+ .cse39 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse41 8)) (<= (+ .cse39 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse41) .cse40) (<= .cse38 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)))))) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse42) (< .cse43 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse44 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse43) (< .cse42 (+ .cse45 2)) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse50 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse49 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse51 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse47 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse48 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse46 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse50))) (and (< .cse46 (+ .cse47 8 .cse48)) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse49) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse50) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse51 2) .cse49) (<= .cse49 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse51 1)) (<= (+ .cse47 .cse48) .cse46) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (< .cse52 (+ .cse44 v_mult_~n_BEFORE_CALL_130 |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= (+ .cse44 v_mult_~n_BEFORE_CALL_130 |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 8) .cse52)))))) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse54 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse53 (+ .cse54 1)) (.cse57 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse56 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse55 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (and (< .cse53 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse54 2) .cse55) (< .cse56 (+ .cse57 v_mult_~n_BEFORE_CALL_130 |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 8)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse53) (<= (+ .cse57 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse57 v_mult_~n_BEFORE_CALL_130 |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) .cse56) (<= .cse55 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse61 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse59 (+ .cse61 1)) (.cse58 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse60 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse63 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse62 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|)))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse58) (< .cse59 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse60 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse59) (< .cse58 (+ .cse61 2)) (< .cse62 (+ .cse60 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse63)) (<= (+ .cse60 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse63 8) .cse62))))) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse68 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse65 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse66 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse64 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse68)) (.cse69 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse67 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (< .cse64 (+ .cse65 .cse66)) (<= .cse67 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse68)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (< (+ .cse69 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (<= (+ .cse65 8 .cse66) .cse64) (< .cse67 (+ .cse69 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse67))))))))))) (<= |c_mult_#in~m| 0)) is different from false [2021-11-19 15:49:39,771 WARN L860 $PredicateComparison]: unable to prove that (or (and (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse11 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse2 (* 2 |c_mult_#in~n|)) (.cse0 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse1 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse4 (+ .cse11 1)) (.cse3 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (or (< .cse0 (+ .cse1 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse2)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse3) (< .cse4 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse6 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse5 (+ .cse6 1)) (.cse7 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse10 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse8 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse9 (* 2 |c_mult_#in~n|))) (and (< .cse5 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse6 2) .cse7) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse5) (<= (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse9) .cse10) (<= .cse7 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (< .cse10 (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse9 8)))))) (<= (+ .cse1 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse2 8) .cse0) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse1 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse4) (< .cse3 (+ .cse11 2)))))) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse16 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse13 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse14 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse12 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse16 (* 2 |c_mult_#in~n|))) (.cse23 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse15 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (< .cse12 (+ .cse13 .cse14)) (<= .cse15 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse16)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse21 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse17 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse22 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse20 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse21 (* 2 |c_mult_#in~n|))) (.cse18 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse19 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|))) (and (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse17) (<= (+ .cse18 .cse19) .cse20) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse21) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse22 2) .cse17) (<= .cse17 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse22 1)) (< .cse20 (+ .cse18 8 .cse19)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (<= (+ .cse13 8 .cse14) .cse12) (< (+ .cse23 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (< .cse15 (+ .cse23 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse15)))))) (< |c_mult_#in~m| 1) (< 1 |c_mult_#in~m|)) is different from true [2021-11-19 15:49:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 47 proven. 389 refuted. 10 times theorem prover too weak. 80 trivial. 61 not checked. [2021-11-19 15:49:40,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060192932] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 15:49:40,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [101375196] [2021-11-19 15:49:40,457 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-19 15:49:40,457 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 15:49:40,458 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 15:49:40,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 15:49:40,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 26, 47] total 105 [2021-11-19 15:49:40,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668700848] [2021-11-19 15:49:40,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 15:49:40,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2021-11-19 15:49:40,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 15:49:40,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2021-11-19 15:49:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=9738, Unknown=15, NotChecked=804, Total=10920 [2021-11-19 15:49:40,463 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 105 states, 100 states have (on average 1.52) internal successors, (152), 67 states have internal predecessors, (152), 28 states have call successors, (28), 2 states have call predecessors, (28), 27 states have return successors, (38), 37 states have call predecessors, (38), 28 states have call successors, (38) [2021-11-19 15:49:42,646 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse72 (+ (* 4 |c_mult_#in~m|) |c_mult_#in~n|)) (.cse71 (+ (* 4 c_mult_~m) c_mult_~n)) (.cse70 (<= c_mult_~m 0)) (.cse74 (+ (* 8 |c_mult_#in~m|) |c_mult_#in~n|)) (.cse73 (+ (* 8 c_mult_~m) c_mult_~n))) (and (= |c_mult_#in~n| c_mult_~n) (<= 0 |c_mult_#in~m|) (forall ((|v_mult_#in~n_BEFORE_CALL_130| Int) (v_mult_~n_BEFORE_CALL_130 Int)) (or (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse4 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse2 (+ v_mult_~n_BEFORE_CALL_130 |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse4)) (.cse0 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse1 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse3 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse5 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8))) (and (<= (+ .cse0 .cse1) .cse2) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse3) (< .cse2 (+ .cse0 8 .cse1)) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse4) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse5 2) .cse3) (<= .cse3 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse5 1)) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse9 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse7 (+ .cse9 1)) (.cse6 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse8 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse11 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse10 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|)))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse6) (< .cse7 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse7) (< .cse6 (+ .cse9 2)) (< .cse10 (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse11)) (<= (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse11 8) .cse10))))) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse16 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse13 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse14 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse12 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse16)) (.cse17 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse15 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (< .cse12 (+ .cse13 .cse14)) (<= .cse15 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse16)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (< (+ .cse17 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (<= (+ .cse13 8 .cse14) .cse12) (< .cse15 (+ .cse17 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse15))))) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (and (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse28 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse19 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse20 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse18 (+ v_mult_~n_BEFORE_CALL_130 |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse28)) (.cse35 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse27 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (< .cse18 (+ .cse19 .cse20)) (<= (+ .cse19 8 .cse20) .cse18) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse22 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse21 (+ .cse22 1)) (.cse24 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse26 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse25 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse23 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (and (< .cse21 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse22 2) .cse23) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse21) (<= (+ .cse24 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (< .cse25 (+ .cse24 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse26 8)) (<= (+ .cse24 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse26) .cse25) (<= .cse23 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)))))) (<= .cse27 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse28)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse33 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse32 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse34 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse30 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse31 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse29 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse33))) (and (< .cse29 (+ .cse30 8 .cse31)) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse32) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse33) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse34 2) .cse32) (<= .cse32 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse34 1)) (<= (+ .cse30 .cse31) .cse29) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (< (+ .cse35 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (< .cse27 (+ .cse35 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse27))))) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse45 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse43 (+ .cse45 1)) (.cse42 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse44 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse52 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|)))) (or (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse37 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse36 (+ .cse37 1)) (.cse39 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse41 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse40 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse38 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (and (< .cse36 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse37 2) .cse38) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse36) (<= (+ .cse39 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (< .cse40 (+ .cse39 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse41 8)) (<= (+ .cse39 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse41) .cse40) (<= .cse38 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)))))) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse42) (< .cse43 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse44 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse43) (< .cse42 (+ .cse45 2)) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse50 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse49 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse51 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse47 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse48 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse46 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse50))) (and (< .cse46 (+ .cse47 8 .cse48)) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse49) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse50) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse51 2) .cse49) (<= .cse49 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse51 1)) (<= (+ .cse47 .cse48) .cse46) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (< .cse52 (+ .cse44 v_mult_~n_BEFORE_CALL_130 |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= (+ .cse44 v_mult_~n_BEFORE_CALL_130 |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 8) .cse52)))))) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse54 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse53 (+ .cse54 1)) (.cse57 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse56 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse55 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (and (< .cse53 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse54 2) .cse55) (< .cse56 (+ .cse57 v_mult_~n_BEFORE_CALL_130 |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 8)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse53) (<= (+ .cse57 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse57 v_mult_~n_BEFORE_CALL_130 |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) .cse56) (<= .cse55 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse61 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse59 (+ .cse61 1)) (.cse58 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse60 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse63 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse62 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|)))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse58) (< .cse59 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse60 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse59) (< .cse58 (+ .cse61 2)) (< .cse62 (+ .cse60 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse63)) (<= (+ .cse60 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse63 8) .cse62))))) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse68 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse65 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse66 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse64 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse68)) (.cse69 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse67 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (< .cse64 (+ .cse65 .cse66)) (<= .cse67 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse68)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (< (+ .cse69 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (<= (+ .cse65 8 .cse66) .cse64) (< .cse67 (+ .cse69 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse67))))))))))) (= |c_mult_#in~m| c_mult_~m) (or .cse70 (<= .cse71 .cse72)) (= |c_mult_#res| 0) (<= .cse72 .cse71) (< 0 (+ c_mult_~m 1)) (<= 0 c_mult_~m) (<= |c_mult_#in~m| 0) (or .cse70 (<= .cse73 .cse74)) (<= .cse74 .cse73))) is different from false [2021-11-19 15:49:44,765 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_mult_#in~m|) (forall ((|v_mult_#in~n_BEFORE_CALL_130| Int) (v_mult_~n_BEFORE_CALL_130 Int)) (or (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse4 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse2 (+ v_mult_~n_BEFORE_CALL_130 |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse4)) (.cse0 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse1 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse3 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse5 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8))) (and (<= (+ .cse0 .cse1) .cse2) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse3) (< .cse2 (+ .cse0 8 .cse1)) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse4) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse5 2) .cse3) (<= .cse3 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse5 1)) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse9 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse7 (+ .cse9 1)) (.cse6 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse8 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse11 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse10 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|)))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse6) (< .cse7 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse7) (< .cse6 (+ .cse9 2)) (< .cse10 (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse11)) (<= (+ .cse8 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse11 8) .cse10))))) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse16 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse13 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse14 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse12 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse16)) (.cse17 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse15 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (< .cse12 (+ .cse13 .cse14)) (<= .cse15 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse16)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (< (+ .cse17 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (<= (+ .cse13 8 .cse14) .cse12) (< .cse15 (+ .cse17 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse15))))) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (and (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse28 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse19 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse20 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse18 (+ v_mult_~n_BEFORE_CALL_130 |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse28)) (.cse35 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse27 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (< .cse18 (+ .cse19 .cse20)) (<= (+ .cse19 8 .cse20) .cse18) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse22 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse21 (+ .cse22 1)) (.cse24 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse26 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse25 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse23 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (and (< .cse21 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse22 2) .cse23) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse21) (<= (+ .cse24 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (< .cse25 (+ .cse24 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse26 8)) (<= (+ .cse24 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse26) .cse25) (<= .cse23 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)))))) (<= .cse27 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse28)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse33 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse32 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse34 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse30 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse31 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse29 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse33))) (and (< .cse29 (+ .cse30 8 .cse31)) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse32) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse33) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse34 2) .cse32) (<= .cse32 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse34 1)) (<= (+ .cse30 .cse31) .cse29) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (< (+ .cse35 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (< .cse27 (+ .cse35 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse27))))) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse45 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse43 (+ .cse45 1)) (.cse42 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse44 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse52 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|)))) (or (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse37 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse36 (+ .cse37 1)) (.cse39 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse41 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse40 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse38 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (and (< .cse36 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse37 2) .cse38) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse36) (<= (+ .cse39 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (< .cse40 (+ .cse39 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse41 8)) (<= (+ .cse39 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse41) .cse40) (<= .cse38 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)))))) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse42) (< .cse43 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse44 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse43) (< .cse42 (+ .cse45 2)) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse50 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse49 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse51 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse47 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse48 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse46 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse50))) (and (< .cse46 (+ .cse47 8 .cse48)) (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse49) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse50) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse51 2) .cse49) (<= .cse49 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse51 1)) (<= (+ .cse47 .cse48) .cse46) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (< .cse52 (+ .cse44 v_mult_~n_BEFORE_CALL_130 |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= (+ .cse44 v_mult_~n_BEFORE_CALL_130 |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 8) .cse52)))))) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse54 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse53 (+ .cse54 1)) (.cse57 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse56 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse55 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (and (< .cse53 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse54 2) .cse55) (< .cse56 (+ .cse57 v_mult_~n_BEFORE_CALL_130 |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 8)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse53) (<= (+ .cse57 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse57 v_mult_~n_BEFORE_CALL_130 |v_mult_#in~n_BEFORE_CALL_130| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) .cse56) (<= .cse55 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse61 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse59 (+ .cse61 1)) (.cse58 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse60 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse63 (* 2 |v_mult_#in~n_BEFORE_CALL_130|)) (.cse62 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|)))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse58) (< .cse59 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse60 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse59) (< .cse58 (+ .cse61 2)) (< .cse62 (+ .cse60 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse63)) (<= (+ .cse60 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse63 8) .cse62))))) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse68 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse65 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse66 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse64 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (* 2 |v_mult_#in~n_BEFORE_CALL_130|) .cse68)) (.cse69 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse67 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (< .cse64 (+ .cse65 .cse66)) (<= .cse67 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse68)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (< (+ .cse69 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (<= (+ .cse65 8 .cse66) .cse64) (< .cse67 (+ .cse69 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse67))))))))))) (= |c_mult_#res| 0) (<= |c_mult_#in~m| 0)) is different from false [2021-11-19 15:49:46,821 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_mult_#in~n| c_mult_~n) (<= 1 |c_mult_#in~m|) (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse16 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse1 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse0 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse3 (+ .cse16 1)) (.cse2 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8)))) (or (<= (+ .cse0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| |c_mult_#t~ret5| 8 |c_mult_#in~n| c_mult_~n) .cse1) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse2) (< .cse3 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (< .cse1 (+ .cse0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n)) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse5 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse4 (+ .cse5 1)) (.cse6 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse9 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse7 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse8 (* 2 |c_mult_#in~n|))) (and (< .cse4 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse5 2) .cse6) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse4) (<= (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse8) .cse9) (<= .cse6 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (< .cse9 (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse8 8)))))) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse14 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse10 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse15 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse13 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse14 (* 2 |c_mult_#in~n|))) (.cse11 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse12 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|))) (and (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse10) (<= (+ .cse11 .cse12) .cse13) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse14) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse15 2) .cse10) (<= .cse10 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse15 1)) (< .cse13 (+ .cse11 8 .cse12)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse3) (< .cse2 (+ .cse16 2)))))) (<= |c_mult_#in~m| 1) (= |c_mult_#t~ret5| 0) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse24 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse33 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse24 |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n)) (.cse31 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse32 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse34 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse23 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse18 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse17 (+ .cse18 1)) (.cse19 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse22 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse20 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse21 (* 2 |c_mult_#in~n|))) (and (< .cse17 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse18 2) .cse19) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse17) (<= (+ .cse20 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse20 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse21) .cse22) (<= .cse19 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (< .cse22 (+ .cse20 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse21 8)))))) (<= .cse23 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse24)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse29 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse25 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse30 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse28 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse29 (* 2 |c_mult_#in~n|))) (.cse26 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse27 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|))) (and (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse25) (<= (+ .cse26 .cse27) .cse28) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse29) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse30 2) .cse25) (<= .cse25 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse30 1)) (< .cse28 (+ .cse26 8 .cse27)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (<= (+ .cse31 8 .cse32) .cse33) (< .cse33 (+ .cse31 .cse32)) (< (+ .cse34 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (< .cse23 (+ .cse34 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse23)))))) is different from false [2021-11-19 15:49:48,836 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse16 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse3 (+ .cse16 1)) (.cse2 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse1 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse0 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|))) (or (<= (+ .cse0 |c_mult_#res| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 8 |c_mult_#in~n|) .cse1) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1) .cse2) (< .cse3 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse5 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse4 (+ .cse5 1)) (.cse6 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse9 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse7 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse8 (* 2 |c_mult_#in~n|))) (and (< .cse4 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse5 2) .cse6) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse4) (<= (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse8) .cse9) (<= .cse6 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (< .cse9 (+ .cse7 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse8 8)))))) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|) (+ .cse0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse14 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse10 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse15 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse13 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse14 (* 2 |c_mult_#in~n|))) (.cse11 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse12 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|))) (and (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse10) (<= (+ .cse11 .cse12) .cse13) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse14) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse15 2) .cse10) (<= .cse10 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse15 1)) (< .cse13 (+ .cse11 8 .cse12)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_128_101| .cse3) (< .cse2 (+ .cse16 2)) (< .cse1 (+ .cse0 |c_mult_#res| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| |c_mult_#in~n|)))))) (<= 1 |c_mult_#in~m|) (<= |c_mult_#in~m| 1) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|v_mult_#in~n_BEFORE_CALL_129| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse27 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse19 (+ |c_mult_#res| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse27 |c_mult_#in~n|)) (.cse17 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse18 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|)) (.cse34 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse26 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8)))) (or (<= (+ .cse17 8 .cse18) .cse19) (exists ((|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_101| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| Int)) (let ((.cse21 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 4)) 8))) (let ((.cse20 (+ .cse21 1)) (.cse22 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| (- 32))) (- 8))) (.cse25 (+ (* 2 |v_mult_#in~n_BEFORE_CALL_129|) (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|))) (.cse23 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|)) (.cse24 (* 2 |c_mult_#in~n|))) (and (< .cse20 |aux_div_v_mult_#in~n_BEFORE_CALL_128_101|) (<= (+ .cse21 2) .cse22) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146| .cse20) (<= (+ .cse23 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146|)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137|) (<= (+ .cse23 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse24) .cse25) (<= .cse22 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| 1)) (< .cse25 (+ .cse23 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_101_146_137| .cse24 8)))))) (<= .cse26 (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1)) (< (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse27)) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 0) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_128_67| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| Int)) (let ((.cse32 (* 8 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))) (let ((.cse28 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 4)) (* |v_mult_#in~n_BEFORE_CALL_129| 12) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| (- 32))) (- 8))) (.cse33 (div (+ (- 1) (* |v_mult_#in~n_BEFORE_CALL_129| (- 12)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 32) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 4)) 8)) (.cse31 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse32 (* 2 |c_mult_#in~n|))) (.cse29 (* 2 |v_mult_#in~n_BEFORE_CALL_129|)) (.cse30 (* 8 |aux_div_v_mult_#in~n_BEFORE_CALL_128_67|))) (and (< (+ |aux_div_v_mult_#in~n_BEFORE_CALL_128_67| 1) .cse28) (<= (+ .cse29 .cse30) .cse31) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| .cse32) (* 8 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|)) (<= (+ .cse33 2) .cse28) (<= .cse28 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1)) (<= |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154| (+ .cse33 1)) (< .cse31 (+ .cse29 8 .cse30)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135|))))) (< .cse19 (+ .cse17 .cse18)) (< (+ .cse34 1) |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154|) (< .cse26 (+ .cse34 2)) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_128_67_154_135| 1) .cse26))))) (= |c_mult_#res| |c_mult_#in~n|)) is different from false [2021-11-19 15:49:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 15:49:55,191 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2021-11-19 15:49:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-19 15:49:55,192 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 100 states have (on average 1.52) internal successors, (152), 67 states have internal predecessors, (152), 28 states have call successors, (28), 2 states have call predecessors, (28), 27 states have return successors, (38), 37 states have call predecessors, (38), 28 states have call successors, (38) Word has length 103 [2021-11-19 15:49:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 15:49:55,194 INFO L225 Difference]: With dead ends: 108 [2021-11-19 15:49:55,194 INFO L226 Difference]: Without dead ends: 96 [2021-11-19 15:49:55,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 155 SyntacticMatches, 4 SemanticMatches, 139 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3504 ImplicationChecksByTransitivity, 76.9s TimeCoverageRelationStatistics Valid=1485, Invalid=16083, Unknown=20, NotChecked=2152, Total=19740 [2021-11-19 15:49:55,197 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 139 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 3067 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 3902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 3067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 577 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-19 15:49:55,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 903 Invalid, 3902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 3067 Invalid, 0 Unknown, 577 Unchecked, 2.1s Time] [2021-11-19 15:49:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-19 15:49:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2021-11-19 15:49:55,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 9 states have call successors, (9), 4 states have call predecessors, (9), 15 states have return successors, (40), 19 states have call predecessors, (40), 9 states have call successors, (40) [2021-11-19 15:49:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2021-11-19 15:49:55,231 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 103 [2021-11-19 15:49:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 15:49:55,232 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2021-11-19 15:49:55,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 100 states have (on average 1.52) internal successors, (152), 67 states have internal predecessors, (152), 28 states have call successors, (28), 2 states have call predecessors, (28), 27 states have return successors, (38), 37 states have call predecessors, (38), 28 states have call successors, (38) [2021-11-19 15:49:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2021-11-19 15:49:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-19 15:49:55,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 15:49:55,237 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 15:49:55,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-19 15:49:55,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-19 15:49:55,460 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 15:49:55,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 15:49:55,460 INFO L85 PathProgramCache]: Analyzing trace with hash -545950054, now seen corresponding path program 13 times [2021-11-19 15:49:55,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 15:49:55,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053917900] [2021-11-19 15:49:55,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 15:49:55,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 15:49:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:49:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 418 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-11-19 15:49:56,976 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 15:49:56,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053917900] [2021-11-19 15:49:56,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053917900] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 15:49:56,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90022552] [2021-11-19 15:49:56,977 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 15:49:56,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 15:49:56,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 15:49:56,978 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 15:49:56,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f107da-21c4-4608-8d8d-1baeb25fb3d5/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-19 15:49:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 15:49:57,105 WARN L261 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 157 conjunts are in the unsatisfiable core [2021-11-19 15:49:57,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 15:49:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 5 proven. 233 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2021-11-19 15:49:58,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 15:50:35,131 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse8 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6)) (* |c_mult_#res| (- 6)) (* |c_mult_#in~n| (- 6))) 5))) (let ((.cse7 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30)) (* |c_mult_#res| 6) (* |c_mult_#in~n| 6)) (- 5))) (.cse5 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse6 (+ .cse8 1))) (or (<= 5 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (exists ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse3 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6)) (* |c_mult_#in~n| (- 24))) 5))) (let ((.cse2 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse1 (* 4 |c_mult_#in~n|)) (.cse0 (+ .cse3 1)) (.cse4 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30)) (* |c_mult_#in~n| 24)) (- 5)))) (and (< .cse0 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse1 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|)) .cse2) (<= (+ 2 .cse3) .cse4) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 5) (<= .cse2 (+ (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse1)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| .cse0) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= .cse4 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1)))))) (< (+ |c_mult_#res| (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| |c_mult_#in~n|) .cse5) (< .cse6 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (< .cse7 (+ .cse8 2)) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1) .cse7) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse14 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse11 (+ .cse14 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (* 4 |c_mult_#in~n|))) (.cse9 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse10 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse13 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse12 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5)))) (and (<= (+ .cse9 .cse10) .cse11) (<= .cse12 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (< .cse11 (+ 5 .cse9 .cse10)) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1) .cse12) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| (+ .cse13 1)) (<= (+ .cse14 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)) (<= (+ 2 .cse13) .cse12))))) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 0) (< .cse5 (+ |c_mult_#res| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| |c_mult_#in~n| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|))) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse6))))) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse16 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse15 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5))) (.cse20 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse18 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse19 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse17 (+ .cse16 |c_mult_#res| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| |c_mult_#in~n|))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1) .cse15) (< (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (+ .cse16 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (< .cse17 (+ .cse18 .cse19)) (< .cse15 (+ 2 .cse20)) (exists ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse24 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6)) (* |c_mult_#in~n| (- 24))) 5))) (let ((.cse23 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse22 (* 4 |c_mult_#in~n|)) (.cse21 (+ .cse24 1)) (.cse25 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30)) (* |c_mult_#in~n| 24)) (- 5)))) (and (< .cse21 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse22 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|)) .cse23) (<= (+ 2 .cse24) .cse25) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 5) (<= .cse23 (+ (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse22)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| .cse21) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= .cse25 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1)))))) (<= .cse15 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1)) (< (+ .cse20 1) |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse31 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse28 (+ .cse31 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (* 4 |c_mult_#in~n|))) (.cse26 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse27 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse30 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse29 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5)))) (and (<= (+ .cse26 .cse27) .cse28) (<= .cse29 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (< .cse28 (+ 5 .cse26 .cse27)) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1) .cse29) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| (+ .cse30 1)) (<= (+ .cse31 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)) (<= (+ 2 .cse30) .cse29))))) (<= (+ 5 .cse18 .cse19) .cse17))))) (<= 3 |c_mult_#in~m|) (<= |c_mult_#in~m| 3)) is different from false [2021-11-19 15:50:42,081 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse14 (div (+ (* c_mult_~n (- 6)) (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6)) (* |c_mult_#t~ret5| (- 6)) (* |c_mult_#in~n| (- 6))) 5))) (let ((.cse0 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse7 (+ .cse14 1)) (.cse6 (div (+ (* c_mult_~n 6) (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30)) (* |c_mult_#in~n| 6) (* |c_mult_#t~ret5| 6)) (- 5)))) (or (< .cse0 (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| |c_mult_#t~ret5| |c_mult_#in~n| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|) c_mult_~n)) (<= 5 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (exists ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse4 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6)) (* |c_mult_#in~n| (- 24))) 5))) (let ((.cse3 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse2 (* 4 |c_mult_#in~n|)) (.cse1 (+ .cse4 1)) (.cse5 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30)) (* |c_mult_#in~n| 24)) (- 5)))) (and (< .cse1 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse2 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|)) .cse3) (<= (+ 2 .cse4) .cse5) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 5) (<= .cse3 (+ (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse2)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| .cse1) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= .cse5 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1)))))) (< (+ (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n) .cse0) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1) .cse6) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse7) (< .cse7 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse13 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse10 (+ .cse13 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (* 4 |c_mult_#in~n|))) (.cse8 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse9 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse12 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse11 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5)))) (and (<= (+ .cse8 .cse9) .cse10) (<= .cse11 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (< .cse10 (+ 5 .cse8 .cse9)) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1) .cse11) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| (+ .cse12 1)) (<= (+ .cse13 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)) (<= (+ 2 .cse12) .cse11))))) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 0) (< .cse6 (+ .cse14 2)))))) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse16 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse15 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5))) (.cse24 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse25 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse23 (+ .cse16 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n)) (.cse17 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1) .cse15) (< (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (+ .cse16 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (< .cse15 (+ 2 .cse17)) (exists ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse21 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6)) (* |c_mult_#in~n| (- 24))) 5))) (let ((.cse20 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse19 (* 4 |c_mult_#in~n|)) (.cse18 (+ .cse21 1)) (.cse22 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30)) (* |c_mult_#in~n| 24)) (- 5)))) (and (< .cse18 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= (+ |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse19 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|)) .cse20) (<= (+ 2 .cse21) .cse22) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 5) (<= .cse20 (+ (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse19)) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| .cse18) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= .cse22 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1)))))) (< .cse23 (+ .cse24 .cse25)) (<= .cse15 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1)) (<= (+ 5 .cse24 .cse25) .cse23) (< (+ .cse17 1) |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse31 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse28 (+ .cse31 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (* 4 |c_mult_#in~n|))) (.cse26 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse27 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse30 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse29 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5)))) (and (<= (+ .cse26 .cse27) .cse28) (<= .cse29 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (< .cse28 (+ 5 .cse26 .cse27)) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1) .cse29) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| (+ .cse30 1)) (<= (+ .cse31 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)) (<= (+ 2 .cse30) .cse29))))))))) (<= 3 |c_mult_#in~m|) (<= |c_mult_#in~m| 3)) is different from false [2021-11-19 15:51:18,312 WARN L227 SmtUtils]: Spent 18.10s on a formula simplification that was a NOOP. DAG size: 131 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 15:52:27,454 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_mult_#in~n_BEFORE_CALL_150| Int)) (or (exists ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse15 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6)) (* |c_mult_#in~n| (- 18)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 6))) 5))) (let ((.cse1 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse0 (* 3 |c_mult_#in~n|)) (.cse14 (div (+ (- 1) (* |c_mult_#in~n| 18) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_150| 6)) (- 5))) (.cse2 (+ 1 .cse15))) (and (<= (+ .cse0 |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|)) .cse1) (<= .cse1 (+ .cse0 (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|)) (< .cse2 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 5) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse4 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse3 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5))) (.cse8 (+ .cse4 (* 4 |v_mult_#in~n_BEFORE_CALL_150|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (.cse6 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse7 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse5 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1) .cse3) (< (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (+ .cse4 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (< .cse3 (+ 2 .cse5)) (<= (+ 5 .cse6 .cse7) .cse8) (<= .cse3 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1)) (< .cse8 (+ .cse6 .cse7)) (< (+ .cse5 1) |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|))))) (forall ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse13 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 24)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6))) 5))) (let ((.cse11 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse10 (* 4 |v_mult_#in~n_BEFORE_CALL_150|)) (.cse12 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_150| 24) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30))) (- 5))) (.cse9 (+ .cse13 1))) (or (< .cse9 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (<= 5 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (< (+ .cse10 (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) .cse11) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1) .cse12) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 0) (< .cse11 (+ .cse10 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|))) (< .cse12 (+ .cse13 2)) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse9))))) (<= .cse14 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1)) (<= (+ 2 .cse15) .cse14) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| .cse2) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))))) (and (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse20 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse16 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5))) (.cse21 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse18 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse19 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse17 (+ .cse20 |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| |c_mult_#in~n|))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1) .cse16) (< .cse17 (+ .cse18 .cse19)) (< (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (+ .cse20 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (< .cse16 (+ 2 .cse21)) (<= .cse16 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1)) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse27 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse25 (+ .cse27 (* 4 |v_mult_#in~n_BEFORE_CALL_150|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (.cse23 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse24 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse26 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse22 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5)))) (and (<= .cse22 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (<= (+ .cse23 .cse24) .cse25) (< .cse25 (+ 5 .cse23 .cse24)) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1) .cse22) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| (+ .cse26 1)) (<= (+ .cse27 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)) (<= (+ 2 .cse26) .cse22))))) (< (+ .cse21 1) |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (exists ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse28 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 24)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6))) 5))) (let ((.cse30 (+ .cse28 1)) (.cse29 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_150| 24) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30))) (- 5))) (.cse32 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse31 (* 4 |v_mult_#in~n_BEFORE_CALL_150|))) (and (<= (+ .cse28 2) .cse29) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| .cse30) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 5) (< .cse30 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= .cse29 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= (+ .cse31 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|)) .cse32) (<= .cse32 (+ .cse31 (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|)))))) (<= (+ 5 .cse18 .cse19) .cse17))))) (forall ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse34 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6)) (* |c_mult_#res| (- 6)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 6)) (* |c_mult_#in~n| (- 6))) 5))) (let ((.cse33 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30)) (* |c_mult_#res| 6) (* |v_mult_#in~n_BEFORE_CALL_150| 6) (* |c_mult_#in~n| 6)) (- 5))) (.cse36 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse35 (+ .cse34 1))) (or (<= 5 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1) .cse33) (< .cse33 (+ 2 .cse34)) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse35) (< .cse36 (+ |c_mult_#res| |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| |c_mult_#in~n| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|))) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse42 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse40 (+ .cse42 (* 4 |v_mult_#in~n_BEFORE_CALL_150|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (.cse38 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse39 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse41 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse37 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5)))) (and (<= .cse37 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (<= (+ .cse38 .cse39) .cse40) (< .cse40 (+ 5 .cse38 .cse39)) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1) .cse37) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| (+ .cse41 1)) (<= (+ .cse42 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)) (<= (+ 2 .cse41) .cse37))))) (< (+ |c_mult_#res| (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| |c_mult_#in~n|) .cse36) (exists ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse43 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 24)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6))) 5))) (let ((.cse45 (+ .cse43 1)) (.cse44 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_150| 24) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30))) (- 5))) (.cse47 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse46 (* 4 |v_mult_#in~n_BEFORE_CALL_150|))) (and (<= (+ .cse43 2) .cse44) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| .cse45) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 5) (< .cse45 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= .cse44 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= (+ .cse46 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|)) .cse47) (<= .cse47 (+ .cse46 (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|)))))) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 0) (< .cse35 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)))))) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse64 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse50 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse51 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse49 (+ (* 3 |c_mult_#in~n|) .cse64 |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (.cse63 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse48 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5)))) (and (<= .cse48 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (< .cse49 (+ 5 .cse50 .cse51)) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse53 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse52 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5))) (.cse57 (+ .cse53 (* 4 |v_mult_#in~n_BEFORE_CALL_150|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (.cse55 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse56 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse54 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1) .cse52) (< (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (+ .cse53 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (< .cse52 (+ 2 .cse54)) (<= (+ 5 .cse55 .cse56) .cse57) (<= .cse52 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1)) (< .cse57 (+ .cse55 .cse56)) (< (+ .cse54 1) |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|))))) (forall ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse62 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 24)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6))) 5))) (let ((.cse60 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse59 (* 4 |v_mult_#in~n_BEFORE_CALL_150|)) (.cse61 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_150| 24) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30))) (- 5))) (.cse58 (+ .cse62 1))) (or (< .cse58 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (<= 5 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (< (+ .cse59 (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) .cse60) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1) .cse61) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 0) (< .cse60 (+ .cse59 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|))) (< .cse61 (+ .cse62 2)) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse58))))) (<= (+ .cse50 .cse51) .cse49) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1) .cse48) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| (+ .cse63 1)) (<= (+ .cse64 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)) (<= (+ 2 .cse63) .cse48))))))) (<= 2 |c_mult_#in~m|) (<= |c_mult_#in~m| 2)) is different from false [2021-11-19 15:53:33,043 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_mult_#in~n_BEFORE_CALL_150| Int)) (or (exists ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse15 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6)) (* |c_mult_#in~n| (- 18)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 6))) 5))) (let ((.cse1 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse0 (* 3 |c_mult_#in~n|)) (.cse14 (div (+ (- 1) (* |c_mult_#in~n| 18) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_150| 6)) (- 5))) (.cse2 (+ 1 .cse15))) (and (<= (+ .cse0 |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|)) .cse1) (<= .cse1 (+ .cse0 (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|)) (< .cse2 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 5) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse4 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse3 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5))) (.cse8 (+ .cse4 (* 4 |v_mult_#in~n_BEFORE_CALL_150|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (.cse6 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse7 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse5 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1) .cse3) (< (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (+ .cse4 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (< .cse3 (+ 2 .cse5)) (<= (+ 5 .cse6 .cse7) .cse8) (<= .cse3 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1)) (< .cse8 (+ .cse6 .cse7)) (< (+ .cse5 1) |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|))))) (forall ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse13 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 24)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6))) 5))) (let ((.cse11 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse10 (* 4 |v_mult_#in~n_BEFORE_CALL_150|)) (.cse12 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_150| 24) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30))) (- 5))) (.cse9 (+ .cse13 1))) (or (< .cse9 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (<= 5 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (< (+ .cse10 (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) .cse11) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1) .cse12) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 0) (< .cse11 (+ .cse10 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|))) (< .cse12 (+ .cse13 2)) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse9))))) (<= .cse14 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1)) (<= (+ 2 .cse15) .cse14) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| .cse2) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))))) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse32 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse18 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse19 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse17 (+ (* 3 |c_mult_#in~n|) .cse32 |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (.cse31 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse16 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5)))) (and (<= .cse16 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (< .cse17 (+ 5 .cse18 .cse19)) (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse21 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse20 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5))) (.cse25 (+ .cse21 (* 4 |v_mult_#in~n_BEFORE_CALL_150|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (.cse23 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse24 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse22 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5))) (or (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1) .cse20) (< (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (+ .cse21 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (< .cse20 (+ 2 .cse22)) (<= (+ 5 .cse23 .cse24) .cse25) (<= .cse20 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1)) (< .cse25 (+ .cse23 .cse24)) (< (+ .cse22 1) |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|))))) (forall ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse30 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 24)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6))) 5))) (let ((.cse28 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse27 (* 4 |v_mult_#in~n_BEFORE_CALL_150|)) (.cse29 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_150| 24) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30))) (- 5))) (.cse26 (+ .cse30 1))) (or (< .cse26 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (<= 5 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (< (+ .cse27 (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) .cse28) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1) .cse29) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 0) (< .cse28 (+ .cse27 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|))) (< .cse29 (+ .cse30 2)) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse26))))) (<= (+ .cse18 .cse19) .cse17) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1) .cse16) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| (+ .cse31 1)) (<= (+ .cse32 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)) (<= (+ 2 .cse31) .cse16))))) (and (forall ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse37 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse34 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse35 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse33 (+ .cse37 |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n)) (.cse36 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5))) (.cse38 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5))) (or (< .cse33 (+ .cse34 .cse35)) (<= (+ 5 .cse34 .cse35) .cse33) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 0) (< (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1) .cse36) (< (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (+ .cse37 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (< .cse36 (+ 2 .cse38)) (<= .cse36 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1)) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse44 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse42 (+ .cse44 (* 4 |v_mult_#in~n_BEFORE_CALL_150|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (.cse40 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse41 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse43 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse39 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5)))) (and (<= .cse39 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (<= (+ .cse40 .cse41) .cse42) (< .cse42 (+ 5 .cse40 .cse41)) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1) .cse39) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| (+ .cse43 1)) (<= (+ .cse44 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)) (<= (+ 2 .cse43) .cse39))))) (< (+ .cse38 1) |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (exists ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse45 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 24)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6))) 5))) (let ((.cse47 (+ .cse45 1)) (.cse46 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_150| 24) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30))) (- 5))) (.cse49 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse48 (* 4 |v_mult_#in~n_BEFORE_CALL_150|))) (and (<= (+ .cse45 2) .cse46) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| .cse47) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 5) (< .cse47 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= .cse46 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= (+ .cse48 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|)) .cse49) (<= .cse49 (+ .cse48 (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|)))))))))) (forall ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|v_mult_#in~n_BEFORE_CALL_149| Int)) (let ((.cse64 (div (+ (* c_mult_~n (- 6)) (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6)) (* |c_mult_#t~ret5| (- 6)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 6)) (* |c_mult_#in~n| (- 6))) 5))) (let ((.cse51 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse52 (+ .cse64 1)) (.cse50 (div (+ (* c_mult_~n 6) (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_150| 6) (* |c_mult_#in~n| 6) (* |c_mult_#t~ret5| 6)) (- 5)))) (or (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1) .cse50) (<= 5 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (< .cse51 (+ |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| |c_mult_#t~ret5| |c_mult_#in~n| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|) c_mult_~n)) (< (+ (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |v_mult_#in~n_BEFORE_CALL_150| |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| |c_mult_#t~ret5| |c_mult_#in~n| c_mult_~n) .cse51) (<= |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| .cse52) (< .cse52 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) (exists ((|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| Int) (|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int)) (let ((.cse58 (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|))) (let ((.cse56 (+ .cse58 (* 4 |v_mult_#in~n_BEFORE_CALL_150|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|)) (.cse54 (* 4 |v_mult_#in~n_BEFORE_CALL_149|)) (.cse55 (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146|)) (.cse57 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 6) (* |v_mult_#in~n_BEFORE_CALL_149| (- 30))) 5)) (.cse53 (div (+ (- 1) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 30)) (* |v_mult_#in~n_BEFORE_CALL_149| 30) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| (- 6))) (- 5)))) (and (<= .cse53 (+ |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (<= (+ .cse54 .cse55) .cse56) (< .cse56 (+ 5 .cse54 .cse55)) (< (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146| 1) .cse53) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| (+ .cse57 1)) (<= (+ .cse58 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_146_166|) (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|)) (<= (+ 2 .cse57) .cse53))))) (exists ((|aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int) (|aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| Int) (|aux_div_v_mult_#in~n_BEFORE_CALL_148_79| Int) (|aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| Int)) (let ((.cse59 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 6)) (* |v_mult_#in~n_BEFORE_CALL_150| (- 24)) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 30) (* |v_mult_#in~n_BEFORE_CALL_149| (- 6))) 5))) (let ((.cse61 (+ .cse59 1)) (.cse60 (div (+ (- 1) (* |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 6) (* |v_mult_#in~n_BEFORE_CALL_150| 24) (* |v_mult_#in~n_BEFORE_CALL_149| 6) (* |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (- 30))) (- 5))) (.cse63 (+ (* 4 |v_mult_#in~n_BEFORE_CALL_149|) (* 5 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|))) (.cse62 (* 4 |v_mult_#in~n_BEFORE_CALL_150|))) (and (<= (+ .cse59 2) .cse60) (<= |aux_div_v_mult_#in~n_BEFORE_CALL_148_79| .cse61) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 5) (< .cse61 |aux_div_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= .cse60 (+ |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111| 1)) (<= 0 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|) (<= (+ .cse62 |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| (* 5 |aux_div_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111|)) .cse63) (<= .cse63 (+ .cse62 (* 5 |aux_div_v_mult_#in~n_BEFORE_CALL_148_79|) |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184|)))))) (< |aux_mod_aux_mod_aux_mod_v_mult_#in~n_BEFORE_CALL_148_79_111_184| 0) (< .cse50 (+ .cse64 2))))))))) (<= 2 |c_mult_#in~m|) (<= |c_mult_#in~m| 2)) is different from false [2021-11-19 15:54:41,787 WARN L227 SmtUtils]: Spent 15.00s on a formula simplification that was a NOOP. DAG size: 175 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)