./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/MultCommutative-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/MultCommutative-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:01:16,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:01:16,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:01:16,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:01:16,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:01:16,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:01:16,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:01:16,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:01:16,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:01:16,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:01:16,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:01:16,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:01:16,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:01:16,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:01:16,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:01:16,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:01:16,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:01:16,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:01:16,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:01:16,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:01:16,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:01:16,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:01:16,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:01:16,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:01:16,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:01:16,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:01:16,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:01:16,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:01:16,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:01:16,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:01:16,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:01:16,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:01:16,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:01:16,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:01:16,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:01:16,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:01:16,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:01:16,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:01:16,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:01:16,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:01:16,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:01:16,208 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/config/svcomp-Overflow-32bit-Taipan_Default.epf [2021-11-07 02:01:16,251 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:01:16,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:01:16,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:01:16,254 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:01:16,254 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:01:16,255 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:01:16,255 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:01:16,255 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:01:16,262 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:01:16,262 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:01:16,263 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:01:16,263 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:01:16,264 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:01:16,264 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:01:16,265 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:01:16,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:01:16,266 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:01:16,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 02:01:16,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:01:16,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:01:16,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:01:16,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:01:16,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:01:16,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:01:16,269 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-07 02:01:16,269 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:01:16,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:01:16,269 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:01:16,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:01:16,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:01:16,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:01:16,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:01:16,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:01:16,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:01:16,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:01:16,273 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:01:16,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:01:16,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:01:16,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:01:16,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:01:16,275 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_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/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_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd [2021-11-07 02:01:16,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:01:16,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:01:16,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:01:16,581 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:01:16,584 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:01:16,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/recursive/MultCommutative-2.c [2021-11-07 02:01:16,676 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/data/2a9cd3b05/c351a7b472d34d43bb46cb4def6aa159/FLAGd8351796c [2021-11-07 02:01:17,156 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:01:17,156 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/sv-benchmarks/c/recursive/MultCommutative-2.c [2021-11-07 02:01:17,169 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/data/2a9cd3b05/c351a7b472d34d43bb46cb4def6aa159/FLAGd8351796c [2021-11-07 02:01:17,530 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/data/2a9cd3b05/c351a7b472d34d43bb46cb4def6aa159 [2021-11-07 02:01:17,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:01:17,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:01:17,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:01:17,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:01:17,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:01:17,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f2e507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17, skipping insertion in model container [2021-11-07 02:01:17,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:01:17,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:01:17,798 WARN L228 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_1042bb91-2ee3-4df8-9021-b88930c8260a/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2021-11-07 02:01:17,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:01:17,809 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:01:17,831 WARN L228 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_1042bb91-2ee3-4df8-9021-b88930c8260a/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2021-11-07 02:01:17,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:01:17,843 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:01:17,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17 WrapperNode [2021-11-07 02:01:17,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:01:17,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:01:17,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:01:17,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:01:17,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:01:17,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:01:17,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:01:17,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:01:17,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:01:17,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:01:17,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:01:17,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:01:17,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (1/1) ... [2021-11-07 02:01:17,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:01:17,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:17,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:01:17,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:01:17,985 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2021-11-07 02:01:17,987 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2021-11-07 02:01:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:01:17,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:01:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:01:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:01:18,343 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:01:18,343 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 02:01:18,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:01:18 BoogieIcfgContainer [2021-11-07 02:01:18,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:01:18,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:01:18,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:01:18,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:01:18,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:01:17" (1/3) ... [2021-11-07 02:01:18,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8904d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:01:18, skipping insertion in model container [2021-11-07 02:01:18,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:01:17" (2/3) ... [2021-11-07 02:01:18,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8904d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:01:18, skipping insertion in model container [2021-11-07 02:01:18,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:01:18" (3/3) ... [2021-11-07 02:01:18,353 INFO L111 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2021-11-07 02:01:18,359 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:01:18,359 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-07 02:01:18,420 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:01:18,434 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-07 02:01:18,434 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-07 02:01:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 02:01:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 02:01:18,457 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:18,458 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:18,459 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1027513993, now seen corresponding path program 1 times [2021-11-07 02:01:18,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:18,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426961284] [2021-11-07 02:01:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:18,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:18,780 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:18,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426961284] [2021-11-07 02:01:18,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426961284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:01:18,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:01:18,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:01:18,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719227246] [2021-11-07 02:01:18,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:01:18,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:18,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:01:18,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:01:18,827 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:18,970 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2021-11-07 02:01:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:01:18,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-07 02:01:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:18,982 INFO L225 Difference]: With dead ends: 73 [2021-11-07 02:01:18,982 INFO L226 Difference]: Without dead ends: 42 [2021-11-07 02:01:18,987 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:01:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-07 02:01:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2021-11-07 02:01:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-07 02:01:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2021-11-07 02:01:19,043 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 7 [2021-11-07 02:01:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:19,044 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2021-11-07 02:01:19,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2021-11-07 02:01:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 02:01:19,046 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:19,046 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:19,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:01:19,048 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1788169763, now seen corresponding path program 1 times [2021-11-07 02:01:19,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:19,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321096575] [2021-11-07 02:01:19,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:19,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:19,147 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:19,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321096575] [2021-11-07 02:01:19,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321096575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:01:19,148 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:01:19,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:01:19,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242375907] [2021-11-07 02:01:19,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:01:19,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:01:19,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:01:19,155 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:19,273 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2021-11-07 02:01:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:01:19,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-07 02:01:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:19,279 INFO L225 Difference]: With dead ends: 58 [2021-11-07 02:01:19,280 INFO L226 Difference]: Without dead ends: 56 [2021-11-07 02:01:19,281 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:01:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-07 02:01:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2021-11-07 02:01:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 41 states have internal predecessors, (51), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-07 02:01:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2021-11-07 02:01:19,306 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 8 [2021-11-07 02:01:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:19,306 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2021-11-07 02:01:19,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2021-11-07 02:01:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 02:01:19,308 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:19,309 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:19,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:01:19,311 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:19,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1125158968, now seen corresponding path program 1 times [2021-11-07 02:01:19,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:19,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29688893] [2021-11-07 02:01:19,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:19,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:19,426 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:19,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29688893] [2021-11-07 02:01:19,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29688893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:01:19,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:01:19,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:01:19,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834838751] [2021-11-07 02:01:19,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:01:19,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:01:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:01:19,439 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:19,552 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2021-11-07 02:01:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:01:19,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 02:01:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:19,555 INFO L225 Difference]: With dead ends: 76 [2021-11-07 02:01:19,557 INFO L226 Difference]: Without dead ends: 75 [2021-11-07 02:01:19,557 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:01:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-07 02:01:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2021-11-07 02:01:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 53 states have internal predecessors, (67), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-07 02:01:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2021-11-07 02:01:19,579 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 13 [2021-11-07 02:01:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:19,580 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2021-11-07 02:01:19,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2021-11-07 02:01:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 02:01:19,582 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:19,582 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:19,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:01:19,583 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash -691954174, now seen corresponding path program 1 times [2021-11-07 02:01:19,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:19,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175017275] [2021-11-07 02:01:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:19,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:19,685 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:19,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175017275] [2021-11-07 02:01:19,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175017275] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:01:19,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:01:19,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:01:19,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903267386] [2021-11-07 02:01:19,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:01:19,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:19,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:01:19,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:01:19,690 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 02:01:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:19,758 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2021-11-07 02:01:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:01:19,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-07 02:01:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:19,761 INFO L225 Difference]: With dead ends: 120 [2021-11-07 02:01:19,761 INFO L226 Difference]: Without dead ends: 84 [2021-11-07 02:01:19,762 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:01:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-07 02:01:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2021-11-07 02:01:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 60 states have internal predecessors, (77), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-07 02:01:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2021-11-07 02:01:19,775 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 14 [2021-11-07 02:01:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:19,775 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2021-11-07 02:01:19,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 02:01:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2021-11-07 02:01:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:01:19,777 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:19,777 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:19,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:01:19,777 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash 24264138, now seen corresponding path program 1 times [2021-11-07 02:01:19,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:19,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404338582] [2021-11-07 02:01:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:19,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:19,823 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:19,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404338582] [2021-11-07 02:01:19,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404338582] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:01:19,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:01:19,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:01:19,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122433294] [2021-11-07 02:01:19,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:01:19,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:19,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:01:19,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:01:19,827 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 02:01:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:19,903 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2021-11-07 02:01:19,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:01:19,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-11-07 02:01:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:19,905 INFO L225 Difference]: With dead ends: 101 [2021-11-07 02:01:19,906 INFO L226 Difference]: Without dead ends: 100 [2021-11-07 02:01:19,906 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:01:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-07 02:01:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2021-11-07 02:01:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 72 states have internal predecessors, (92), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-11-07 02:01:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2021-11-07 02:01:19,920 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 15 [2021-11-07 02:01:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:19,921 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2021-11-07 02:01:19,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 02:01:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2021-11-07 02:01:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 02:01:19,923 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:19,923 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:19,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:01:19,923 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1116235770, now seen corresponding path program 1 times [2021-11-07 02:01:19,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:19,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287436919] [2021-11-07 02:01:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:19,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 02:01:19,979 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:19,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287436919] [2021-11-07 02:01:19,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287436919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:01:19,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:01:19,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:01:19,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366825395] [2021-11-07 02:01:19,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:01:19,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:01:19,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:01:19,982 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:20,031 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2021-11-07 02:01:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:01:20,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 02:01:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:20,033 INFO L225 Difference]: With dead ends: 132 [2021-11-07 02:01:20,033 INFO L226 Difference]: Without dead ends: 58 [2021-11-07 02:01:20,035 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:01:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-07 02:01:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2021-11-07 02:01:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-07 02:01:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2021-11-07 02:01:20,043 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 18 [2021-11-07 02:01:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:20,044 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2021-11-07 02:01:20,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:01:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2021-11-07 02:01:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:01:20,045 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:20,045 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:20,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:01:20,046 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:20,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 937076250, now seen corresponding path program 1 times [2021-11-07 02:01:20,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:20,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059052678] [2021-11-07 02:01:20,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:20,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:20,119 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:20,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059052678] [2021-11-07 02:01:20,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059052678] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:20,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333001133] [2021-11-07 02:01:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:20,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:20,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:20,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:20,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 02:01:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:20,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 02:01:20,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:20,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:20,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333001133] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:01:20,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [448609075] [2021-11-07 02:01:20,508 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-07 02:01:20,508 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:01:20,513 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:609) 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-07 02:01:20,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:01:20,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-07 02:01:20,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586648682] [2021-11-07 02:01:20,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 02:01:20,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:20,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 02:01:20,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:01:20,517 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-07 02:01:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:20,634 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2021-11-07 02:01:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:01:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2021-11-07 02:01:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:20,637 INFO L225 Difference]: With dead ends: 66 [2021-11-07 02:01:20,637 INFO L226 Difference]: Without dead ends: 65 [2021-11-07 02:01:20,638 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-07 02:01:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-07 02:01:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2021-11-07 02:01:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-07 02:01:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2021-11-07 02:01:20,660 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 17 [2021-11-07 02:01:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:20,660 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2021-11-07 02:01:20,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-07 02:01:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2021-11-07 02:01:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 02:01:20,662 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:20,663 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:20,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 02:01:20,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:20,888 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1015407268, now seen corresponding path program 1 times [2021-11-07 02:01:20,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:20,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506215519] [2021-11-07 02:01:20,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:20,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:20,973 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:20,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506215519] [2021-11-07 02:01:20,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506215519] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:20,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399071740] [2021-11-07 02:01:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:20,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:20,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:20,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:20,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 02:01:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:21,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 02:01:21,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:21,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:01:21,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399071740] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:01:21,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [446892548] [2021-11-07 02:01:21,249 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:01:21,250 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:01:21,251 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:609) 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-07 02:01:21,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:01:21,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-11-07 02:01:21,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273604343] [2021-11-07 02:01:21,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 02:01:21,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:21,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 02:01:21,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:01:21,264 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-07 02:01:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:21,366 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2021-11-07 02:01:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 02:01:21,367 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-11-07 02:01:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:21,368 INFO L225 Difference]: With dead ends: 64 [2021-11-07 02:01:21,368 INFO L226 Difference]: Without dead ends: 63 [2021-11-07 02:01:21,369 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:01:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-07 02:01:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2021-11-07 02:01:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-07 02:01:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2021-11-07 02:01:21,376 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 18 [2021-11-07 02:01:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:21,377 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2021-11-07 02:01:21,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-07 02:01:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2021-11-07 02:01:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:01:21,379 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:21,379 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:21,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 02:01:21,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:21,593 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2063375789, now seen corresponding path program 1 times [2021-11-07 02:01:21,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:21,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187591699] [2021-11-07 02:01:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:21,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 02:01:21,700 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:21,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187591699] [2021-11-07 02:01:21,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187591699] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:21,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312684956] [2021-11-07 02:01:21,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:21,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:21,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:21,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:21,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 02:01:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:21,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 02:01:21,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 02:01:21,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 02:01:22,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312684956] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:01:22,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [322614213] [2021-11-07 02:01:22,003 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-07 02:01:22,007 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:01:22,008 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:609) 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-07 02:01:22,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:01:22,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2021-11-07 02:01:22,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178600909] [2021-11-07 02:01:22,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 02:01:22,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 02:01:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:01:22,011 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-07 02:01:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:22,203 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2021-11-07 02:01:22,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:01:22,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-11-07 02:01:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:22,205 INFO L225 Difference]: With dead ends: 93 [2021-11-07 02:01:22,205 INFO L226 Difference]: Without dead ends: 92 [2021-11-07 02:01:22,205 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-11-07 02:01:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-07 02:01:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2021-11-07 02:01:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-07 02:01:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2021-11-07 02:01:22,213 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 24 [2021-11-07 02:01:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:22,213 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2021-11-07 02:01:22,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-07 02:01:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2021-11-07 02:01:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:01:22,215 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:22,215 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:22,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 02:01:22,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:22,435 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:22,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash 459860035, now seen corresponding path program 1 times [2021-11-07 02:01:22,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:22,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604178953] [2021-11-07 02:01:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:22,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 02:01:22,515 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:22,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604178953] [2021-11-07 02:01:22,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604178953] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:22,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020062763] [2021-11-07 02:01:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:22,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:22,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:22,528 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:22,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 02:01:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:22,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 02:01:22,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 02:01:22,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 02:01:22,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020062763] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:01:22,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1958745965] [2021-11-07 02:01:22,786 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:01:22,786 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:01:22,786 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:609) 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-07 02:01:22,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:01:22,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-11-07 02:01:22,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150808690] [2021-11-07 02:01:22,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 02:01:22,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:22,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 02:01:22,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:01:22,789 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-07 02:01:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:22,864 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2021-11-07 02:01:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 02:01:22,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-11-07 02:01:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:22,866 INFO L225 Difference]: With dead ends: 96 [2021-11-07 02:01:22,866 INFO L226 Difference]: Without dead ends: 63 [2021-11-07 02:01:22,867 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:01:22,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-07 02:01:22,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2021-11-07 02:01:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 42 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-07 02:01:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2021-11-07 02:01:22,872 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 25 [2021-11-07 02:01:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:22,872 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2021-11-07 02:01:22,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-07 02:01:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2021-11-07 02:01:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 02:01:22,873 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:22,874 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:22,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-07 02:01:23,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:23,088 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash 385020750, now seen corresponding path program 1 times [2021-11-07 02:01:23,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:23,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259191124] [2021-11-07 02:01:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:23,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 02:01:23,170 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:23,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259191124] [2021-11-07 02:01:23,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259191124] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:23,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071621448] [2021-11-07 02:01:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:23,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:23,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:23,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:23,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 02:01:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:23,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 02:01:23,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 02:01:23,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 02:01:23,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071621448] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:01:23,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [328864723] [2021-11-07 02:01:23,722 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:01:23,722 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:01:23,722 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:609) 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-07 02:01:23,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:01:23,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-11-07 02:01:23,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499828482] [2021-11-07 02:01:23,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-07 02:01:23,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:23,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-07 02:01:23,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:01:23,731 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-07 02:01:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:24,047 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2021-11-07 02:01:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 02:01:24,048 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2021-11-07 02:01:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:24,050 INFO L225 Difference]: With dead ends: 86 [2021-11-07 02:01:24,050 INFO L226 Difference]: Without dead ends: 85 [2021-11-07 02:01:24,051 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2021-11-07 02:01:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-07 02:01:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2021-11-07 02:01:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 50 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-07 02:01:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2021-11-07 02:01:24,056 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 28 [2021-11-07 02:01:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:24,056 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2021-11-07 02:01:24,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-07 02:01:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2021-11-07 02:01:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-07 02:01:24,058 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:24,058 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:24,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-07 02:01:24,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-07 02:01:24,272 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -377928031, now seen corresponding path program 1 times [2021-11-07 02:01:24,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:24,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271664552] [2021-11-07 02:01:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:24,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 02:01:24,356 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:24,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271664552] [2021-11-07 02:01:24,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271664552] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:24,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811241301] [2021-11-07 02:01:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:24,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:24,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:24,358 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:24,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 02:01:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:24,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 02:01:24,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 02:01:24,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 02:01:25,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811241301] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:01:25,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [639923488] [2021-11-07 02:01:25,022 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:01:25,022 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:01:25,022 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:609) 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-07 02:01:25,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:01:25,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2021-11-07 02:01:25,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769744002] [2021-11-07 02:01:25,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-07 02:01:25,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-07 02:01:25,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-11-07 02:01:25,025 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-07 02:01:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:25,517 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2021-11-07 02:01:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-07 02:01:25,518 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 35 [2021-11-07 02:01:25,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:25,519 INFO L225 Difference]: With dead ends: 128 [2021-11-07 02:01:25,519 INFO L226 Difference]: Without dead ends: 123 [2021-11-07 02:01:25,520 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2021-11-07 02:01:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-07 02:01:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 68. [2021-11-07 02:01:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 53 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2021-11-07 02:01:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2021-11-07 02:01:25,531 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 35 [2021-11-07 02:01:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:25,532 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2021-11-07 02:01:25,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-07 02:01:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2021-11-07 02:01:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 02:01:25,534 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:25,534 INFO L513 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:25,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-07 02:01:25,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-07 02:01:25,744 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 442028402, now seen corresponding path program 2 times [2021-11-07 02:01:25,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:25,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558058933] [2021-11-07 02:01:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:25,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-07 02:01:25,929 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:25,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558058933] [2021-11-07 02:01:25,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558058933] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:25,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832553366] [2021-11-07 02:01:25,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:01:25,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:25,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:25,932 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:25,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 02:01:26,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-11-07 02:01:26,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:01:26,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-07 02:01:26,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-07 02:01:26,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 10 proven. 96 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-07 02:01:27,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832553366] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:01:27,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1748881324] [2021-11-07 02:01:27,705 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:01:27,705 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:01:27,706 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:609) 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-07 02:01:27,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:01:27,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 30 [2021-11-07 02:01:27,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523690600] [2021-11-07 02:01:27,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-07 02:01:27,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:27,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-07 02:01:27,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2021-11-07 02:01:27,709 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2021-11-07 02:01:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:28,475 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2021-11-07 02:01:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-07 02:01:28,476 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) Word has length 62 [2021-11-07 02:01:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:28,478 INFO L225 Difference]: With dead ends: 139 [2021-11-07 02:01:28,478 INFO L226 Difference]: Without dead ends: 138 [2021-11-07 02:01:28,480 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=479, Invalid=2601, Unknown=0, NotChecked=0, Total=3080 [2021-11-07 02:01:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-07 02:01:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 88. [2021-11-07 02:01:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 69 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 11 states have return successors, (20), 14 states have call predecessors, (20), 5 states have call successors, (20) [2021-11-07 02:01:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-11-07 02:01:28,489 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 62 [2021-11-07 02:01:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:28,489 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-11-07 02:01:28,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2021-11-07 02:01:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-11-07 02:01:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 02:01:28,496 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:28,496 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:28,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-07 02:01:28,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-07 02:01:28,712 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash -325154713, now seen corresponding path program 2 times [2021-11-07 02:01:28,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:28,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025415381] [2021-11-07 02:01:28,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:28,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-07 02:01:28,824 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:28,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025415381] [2021-11-07 02:01:28,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025415381] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:28,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844379175] [2021-11-07 02:01:28,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:01:28,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:28,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:28,831 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:28,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-07 02:01:29,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-07 02:01:29,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:01:29,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 02:01:29,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-07 02:01:29,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-07 02:01:29,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844379175] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:01:29,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [238122097] [2021-11-07 02:01:29,516 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:01:29,516 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:01:29,516 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:609) 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-07 02:01:29,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:01:29,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-11-07 02:01:29,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833777995] [2021-11-07 02:01:29,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-07 02:01:29,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:29,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-07 02:01:29,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-11-07 02:01:29,519 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-07 02:01:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:29,812 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2021-11-07 02:01:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 02:01:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 46 [2021-11-07 02:01:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:29,815 INFO L225 Difference]: With dead ends: 109 [2021-11-07 02:01:29,815 INFO L226 Difference]: Without dead ends: 104 [2021-11-07 02:01:29,816 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2021-11-07 02:01:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-07 02:01:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2021-11-07 02:01:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.064102564102564) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 13 states have return successors, (22), 16 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-07 02:01:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2021-11-07 02:01:29,824 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 46 [2021-11-07 02:01:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:29,825 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2021-11-07 02:01:29,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-07 02:01:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2021-11-07 02:01:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-07 02:01:29,827 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:29,827 INFO L513 BasicCegarLoop]: trace histogram [7, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:29,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-07 02:01:30,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-07 02:01:30,052 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:30,053 INFO L85 PathProgramCache]: Analyzing trace with hash -674862935, now seen corresponding path program 3 times [2021-11-07 02:01:30,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:30,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374958304] [2021-11-07 02:01:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:30,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 115 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-07 02:01:30,289 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:30,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374958304] [2021-11-07 02:01:30,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374958304] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:30,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420879596] [2021-11-07 02:01:30,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:01:30,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:30,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:30,290 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:30,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-07 02:01:30,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:01:30,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:01:30,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-07 02:01:30,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 115 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-07 02:01:30,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 12 proven. 117 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 02:01:32,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420879596] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:01:32,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [867050658] [2021-11-07 02:01:32,197 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:01:32,198 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:01:32,198 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:609) 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-07 02:01:32,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:01:32,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 36 [2021-11-07 02:01:32,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138652098] [2021-11-07 02:01:32,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-07 02:01:32,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:32,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-07 02:01:32,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2021-11-07 02:01:32,203 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) [2021-11-07 02:01:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:33,751 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2021-11-07 02:01:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-07 02:01:33,752 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) Word has length 68 [2021-11-07 02:01:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:33,753 INFO L225 Difference]: With dead ends: 187 [2021-11-07 02:01:33,753 INFO L226 Difference]: Without dead ends: 176 [2021-11-07 02:01:33,755 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=924, Invalid=5082, Unknown=0, NotChecked=0, Total=6006 [2021-11-07 02:01:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-07 02:01:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 161. [2021-11-07 02:01:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.0546875) internal successors, (135), 127 states have internal predecessors, (135), 9 states have call successors, (9), 6 states have call predecessors, (9), 23 states have return successors, (33), 27 states have call predecessors, (33), 7 states have call successors, (33) [2021-11-07 02:01:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions. [2021-11-07 02:01:33,767 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 68 [2021-11-07 02:01:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:33,768 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 177 transitions. [2021-11-07 02:01:33,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) [2021-11-07 02:01:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2021-11-07 02:01:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-07 02:01:33,770 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:33,770 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:33,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-07 02:01:33,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-07 02:01:33,988 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:33,988 INFO L85 PathProgramCache]: Analyzing trace with hash 147099220, now seen corresponding path program 3 times [2021-11-07 02:01:33,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:33,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588483692] [2021-11-07 02:01:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:33,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-11-07 02:01:34,324 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:34,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588483692] [2021-11-07 02:01:34,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588483692] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:34,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411423733] [2021-11-07 02:01:34,324 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:01:34,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:34,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:34,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:34,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-07 02:01:34,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:01:34,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:01:34,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-07 02:01:34,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2021-11-07 02:01:35,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:01:48,949 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_46] [2021-11-07 02:01:48,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2130090795] [2021-11-07 02:01:48,951 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:01:48,952 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:01:48,952 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:609) 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-07 02:01:48,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:01:48,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-07 02:01:48,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413592353] [2021-11-07 02:01:48,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-07 02:01:48,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:01:48,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-07 02:01:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1308, Unknown=5, NotChecked=0, Total=1482 [2021-11-07 02:01:48,956 INFO L87 Difference]: Start difference. First operand 161 states and 177 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-07 02:01:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:01:50,552 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2021-11-07 02:01:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-07 02:01:50,552 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2021-11-07 02:01:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:01:50,554 INFO L225 Difference]: With dead ends: 230 [2021-11-07 02:01:50,554 INFO L226 Difference]: Without dead ends: 229 [2021-11-07 02:01:50,556 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=549, Invalid=4558, Unknown=5, NotChecked=0, Total=5112 [2021-11-07 02:01:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-07 02:01:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 166. [2021-11-07 02:01:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 132 states have (on average 1.053030303030303) internal successors, (139), 131 states have internal predecessors, (139), 9 states have call successors, (9), 6 states have call predecessors, (9), 24 states have return successors, (35), 28 states have call predecessors, (35), 7 states have call successors, (35) [2021-11-07 02:01:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 183 transitions. [2021-11-07 02:01:50,568 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 183 transitions. Word has length 94 [2021-11-07 02:01:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:01:50,569 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 183 transitions. [2021-11-07 02:01:50,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-07 02:01:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 183 transitions. [2021-11-07 02:01:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-07 02:01:50,571 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:01:50,571 INFO L513 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2021-11-07 02:01:50,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-07 02:01:50,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-07 02:01:50,800 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:01:50,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:01:50,800 INFO L85 PathProgramCache]: Analyzing trace with hash -584032592, now seen corresponding path program 4 times [2021-11-07 02:01:50,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:01:50,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460315356] [2021-11-07 02:01:50,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:01:50,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:01:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-11-07 02:01:51,446 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:01:51,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460315356] [2021-11-07 02:01:51,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460315356] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:01:51,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475820563] [2021-11-07 02:01:51,447 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 02:01:51,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:01:51,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:01:51,448 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:01:51,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-07 02:01:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:01:51,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-07 02:01:51,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:01:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-11-07 02:01:53,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:02:09,710 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_59] [2021-11-07 02:02:09,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1801678129] [2021-11-07 02:02:09,712 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:02:09,712 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:02:09,712 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:609) 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-07 02:02:09,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:02:09,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2021-11-07 02:02:09,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854745078] [2021-11-07 02:02:09,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-07 02:02:09,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-07 02:02:09,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1336, Unknown=6, NotChecked=0, Total=1482 [2021-11-07 02:02:09,716 INFO L87 Difference]: Start difference. First operand 166 states and 183 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (9), 9 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-07 02:02:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:11,718 INFO L93 Difference]: Finished difference Result 253 states and 279 transitions. [2021-11-07 02:02:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-07 02:02:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (9), 9 states have call predecessors, (9), 2 states have call successors, (9) Word has length 117 [2021-11-07 02:02:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:11,720 INFO L225 Difference]: With dead ends: 253 [2021-11-07 02:02:11,720 INFO L226 Difference]: Without dead ends: 252 [2021-11-07 02:02:11,722 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 116 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=510, Invalid=5336, Unknown=6, NotChecked=0, Total=5852 [2021-11-07 02:02:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-11-07 02:02:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 171. [2021-11-07 02:02:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.0514705882352942) internal successors, (143), 135 states have internal predecessors, (143), 9 states have call successors, (9), 6 states have call predecessors, (9), 25 states have return successors, (37), 29 states have call predecessors, (37), 7 states have call successors, (37) [2021-11-07 02:02:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 189 transitions. [2021-11-07 02:02:11,735 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 189 transitions. Word has length 117 [2021-11-07 02:02:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:11,736 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 189 transitions. [2021-11-07 02:02:11,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (9), 9 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-07 02:02:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 189 transitions. [2021-11-07 02:02:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-07 02:02:11,739 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:11,739 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2021-11-07 02:02:11,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-07 02:02:11,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:02:11,956 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:02:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash -238126088, now seen corresponding path program 5 times [2021-11-07 02:02:11,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:11,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012402731] [2021-11-07 02:02:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:11,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 405 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2021-11-07 02:02:12,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:12,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012402731] [2021-11-07 02:02:12,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012402731] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:02:12,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784339476] [2021-11-07 02:02:12,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:02:12,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:02:12,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:02:12,584 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:02:12,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-07 02:02:13,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-11-07 02:02:13,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:02:13,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-07 02:02:13,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:02:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 405 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2021-11-07 02:02:14,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:02:21,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_73] [2021-11-07 02:02:21,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [44002351] [2021-11-07 02:02:21,049 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:02:21,049 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:02:21,050 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:609) 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-07 02:02:21,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:02:21,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-11-07 02:02:21,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387378009] [2021-11-07 02:02:21,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-07 02:02:21,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-07 02:02:21,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1570, Unknown=0, NotChecked=0, Total=1722 [2021-11-07 02:02:21,054 INFO L87 Difference]: Start difference. First operand 171 states and 189 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (10), 10 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-07 02:02:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:23,967 INFO L93 Difference]: Finished difference Result 276 states and 306 transitions. [2021-11-07 02:02:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-07 02:02:23,968 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (10), 10 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2021-11-07 02:02:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:23,969 INFO L225 Difference]: With dead ends: 276 [2021-11-07 02:02:23,970 INFO L226 Difference]: Without dead ends: 275 [2021-11-07 02:02:23,972 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 126 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=578, Invalid=6562, Unknown=0, NotChecked=0, Total=7140 [2021-11-07 02:02:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-11-07 02:02:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 176. [2021-11-07 02:02:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 140 states have (on average 1.05) internal successors, (147), 139 states have internal predecessors, (147), 9 states have call successors, (9), 6 states have call predecessors, (9), 26 states have return successors, (39), 30 states have call predecessors, (39), 7 states have call successors, (39) [2021-11-07 02:02:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 195 transitions. [2021-11-07 02:02:23,988 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 195 transitions. Word has length 128 [2021-11-07 02:02:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:23,989 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 195 transitions. [2021-11-07 02:02:23,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (10), 10 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-07 02:02:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 195 transitions. [2021-11-07 02:02:23,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 02:02:23,991 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:23,991 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:02:24,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-07 02:02:24,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-07 02:02:24,208 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:02:24,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1830791249, now seen corresponding path program 4 times [2021-11-07 02:02:24,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:24,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404775517] [2021-11-07 02:02:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:24,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 121 proven. 81 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-11-07 02:02:24,489 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:24,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404775517] [2021-11-07 02:02:24,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404775517] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:02:24,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585750205] [2021-11-07 02:02:24,490 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 02:02:24,490 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:02:24,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:02:24,491 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:02:24,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-07 02:02:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:25,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-07 02:02:25,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:02:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 3 proven. 214 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-11-07 02:02:25,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:02:29,819 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_80] [2021-11-07 02:02:29,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1671851287] [2021-11-07 02:02:29,823 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:02:29,823 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:02:29,823 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:609) 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-07 02:02:29,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:02:29,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-11-07 02:02:29,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631397655] [2021-11-07 02:02:29,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 02:02:29,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:29,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 02:02:29,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1006, Unknown=1, NotChecked=0, Total=1122 [2021-11-07 02:02:29,826 INFO L87 Difference]: Start difference. First operand 176 states and 195 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-07 02:02:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:30,811 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2021-11-07 02:02:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-07 02:02:30,814 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 90 [2021-11-07 02:02:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:30,815 INFO L225 Difference]: With dead ends: 201 [2021-11-07 02:02:30,816 INFO L226 Difference]: Without dead ends: 198 [2021-11-07 02:02:30,817 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=297, Invalid=2458, Unknown=1, NotChecked=0, Total=2756 [2021-11-07 02:02:30,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-07 02:02:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 181. [2021-11-07 02:02:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.0486111111111112) internal successors, (151), 143 states have internal predecessors, (151), 9 states have call successors, (9), 6 states have call predecessors, (9), 27 states have return successors, (40), 31 states have call predecessors, (40), 7 states have call successors, (40) [2021-11-07 02:02:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 200 transitions. [2021-11-07 02:02:30,829 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 200 transitions. Word has length 90 [2021-11-07 02:02:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:30,829 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 200 transitions. [2021-11-07 02:02:30,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-07 02:02:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 200 transitions. [2021-11-07 02:02:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-07 02:02:30,832 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:30,832 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1] [2021-11-07 02:02:30,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-07 02:02:31,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:02:31,048 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:02:31,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1565122770, now seen corresponding path program 6 times [2021-11-07 02:02:31,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:31,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641264992] [2021-11-07 02:02:31,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:31,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2021-11-07 02:02:31,825 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:31,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641264992] [2021-11-07 02:02:31,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641264992] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:02:31,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529666694] [2021-11-07 02:02:31,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:02:31,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:02:31,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:02:31,831 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:02:31,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-07 02:02:32,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:02:32,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:02:32,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-07 02:02:32,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:02:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2021-11-07 02:02:34,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:02:40,778 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_95] [2021-11-07 02:02:40,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1391096674] [2021-11-07 02:02:40,781 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:02:40,781 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:02:40,781 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:609) 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-07 02:02:40,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:02:40,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2021-11-07 02:02:40,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887858548] [2021-11-07 02:02:40,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-07 02:02:40,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:40,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-07 02:02:40,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1816, Unknown=0, NotChecked=0, Total=1980 [2021-11-07 02:02:40,785 INFO L87 Difference]: Start difference. First operand 181 states and 200 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-07 02:02:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:44,004 INFO L93 Difference]: Finished difference Result 296 states and 329 transitions. [2021-11-07 02:02:44,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-07 02:02:44,004 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 2 states have call successors, (11) Word has length 139 [2021-11-07 02:02:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:44,007 INFO L225 Difference]: With dead ends: 296 [2021-11-07 02:02:44,007 INFO L226 Difference]: Without dead ends: 295 [2021-11-07 02:02:44,010 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 136 SyntacticMatches, 9 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1746 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=628, Invalid=7744, Unknown=0, NotChecked=0, Total=8372 [2021-11-07 02:02:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-07 02:02:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 186. [2021-11-07 02:02:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.0472972972972974) internal successors, (155), 147 states have internal predecessors, (155), 9 states have call successors, (9), 6 states have call predecessors, (9), 28 states have return successors, (42), 32 states have call predecessors, (42), 7 states have call successors, (42) [2021-11-07 02:02:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 206 transitions. [2021-11-07 02:02:44,025 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 206 transitions. Word has length 139 [2021-11-07 02:02:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:44,029 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 206 transitions. [2021-11-07 02:02:44,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-07 02:02:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 206 transitions. [2021-11-07 02:02:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-07 02:02:44,031 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:44,045 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 11, 11, 11, 11, 10, 9, 9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:02:44,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-07 02:02:44,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-11-07 02:02:44,272 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:02:44,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:44,272 INFO L85 PathProgramCache]: Analyzing trace with hash -159119921, now seen corresponding path program 5 times [2021-11-07 02:02:44,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:44,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611195056] [2021-11-07 02:02:44,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:44,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 6 proven. 413 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-11-07 02:02:44,736 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:44,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611195056] [2021-11-07 02:02:44,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611195056] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:02:44,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714611774] [2021-11-07 02:02:44,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:02:44,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:02:44,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:02:44,737 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:02:44,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-07 02:02:45,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-11-07 02:02:45,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:02:45,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-07 02:02:45,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:02:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 131 proven. 282 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-11-07 02:02:46,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:02:57,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_107 Int) (v_mult_~n_BEFORE_CALL_108 Int) (|v_mult_#in~n_BEFORE_CALL_68| Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_108 v_mult_~n_BEFORE_CALL_107 |c_mult_#res|) 2147483647) (< v_mult_~n_BEFORE_CALL_108 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_107 |v_mult_#in~n_BEFORE_CALL_68|) (exists ((aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int) (aux_mod_v_mult_~n_BEFORE_CALL_107_76 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int)) (and (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 |v_mult_#in~n_BEFORE_CALL_68| (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44)) 2147483647) (forall ((|v_mult_#in~n_1204| Int)) (or (<= 4294967294 (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) (div (+ aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* |v_mult_#in~n_1204| (- 3)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 6) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 3)) 2) (* 2 v_mult_~n_BEFORE_CALL_108) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (< 2147483647 (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) |v_mult_#in~n_1204|)))) (< aux_mod_v_mult_~n_BEFORE_CALL_107_76 3) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 2) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 v_mult_~n_BEFORE_CALL_108) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (exists ((|v_mult_#in~n_1204| Int)) (and (< (div (+ 2147483647 (* v_mult_~n_BEFORE_CALL_107 (- 1)) (* |v_mult_#in~n_1204| (- 3))) 2) (* 2 v_mult_~n_BEFORE_CALL_107)) (<= |v_mult_#in~n_1204| v_mult_~n_BEFORE_CALL_107))))) is different from false [2021-11-07 02:03:00,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_107 Int) (v_mult_~n_BEFORE_CALL_108 Int) (|v_mult_#in~n_BEFORE_CALL_68| Int)) (or (< v_mult_~n_BEFORE_CALL_108 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_107 |v_mult_#in~n_BEFORE_CALL_68|) (exists ((aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int) (aux_mod_v_mult_~n_BEFORE_CALL_107_76 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int)) (and (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 |v_mult_#in~n_BEFORE_CALL_68| (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44)) 2147483647) (forall ((|v_mult_#in~n_1204| Int)) (or (<= 4294967294 (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) (div (+ aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* |v_mult_#in~n_1204| (- 3)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 6) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 3)) 2) (* 2 v_mult_~n_BEFORE_CALL_108) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (< 2147483647 (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) |v_mult_#in~n_1204|)))) (< aux_mod_v_mult_~n_BEFORE_CALL_107_76 3) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 2) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 v_mult_~n_BEFORE_CALL_108) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (exists ((|v_mult_#in~n_1204| Int)) (and (< (div (+ 2147483647 (* v_mult_~n_BEFORE_CALL_107 (- 1)) (* |v_mult_#in~n_1204| (- 3))) 2) (* 2 v_mult_~n_BEFORE_CALL_107)) (<= |v_mult_#in~n_1204| v_mult_~n_BEFORE_CALL_107))) (<= (+ v_mult_~n_BEFORE_CALL_108 v_mult_~n_BEFORE_CALL_107 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from false [2021-11-07 02:03:06,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_107 Int) (v_mult_~n_BEFORE_CALL_108 Int) (|v_mult_#in~n_1317| Int) (|v_mult_#in~n_BEFORE_CALL_68| Int) (|v_mult_#in~n_1314| Int)) (or (< v_mult_~n_BEFORE_CALL_108 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_107 |v_mult_#in~n_BEFORE_CALL_68|) (exists ((aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int) (aux_mod_v_mult_~n_BEFORE_CALL_107_76 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 Int)) (and (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 |v_mult_#in~n_BEFORE_CALL_68| (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44)) 2147483647) (forall ((|v_mult_#in~n_1204| Int)) (or (<= 4294967294 (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) (div (+ aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* |v_mult_#in~n_1204| (- 3)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 6) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 3)) 2) (* 2 v_mult_~n_BEFORE_CALL_108) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (< 2147483647 (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) aux_mod_v_mult_~n_BEFORE_CALL_107_76 v_mult_~n_BEFORE_CALL_108 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44) |v_mult_#in~n_1204|)))) (< aux_mod_v_mult_~n_BEFORE_CALL_107_76 3) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_107_76) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 2) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_107_76_44 v_mult_~n_BEFORE_CALL_108) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_107_76_44))) (exists ((|v_mult_#in~n_1204| Int)) (and (< (div (+ 2147483647 (* v_mult_~n_BEFORE_CALL_107 (- 1)) (* |v_mult_#in~n_1204| (- 3))) 2) (* 2 v_mult_~n_BEFORE_CALL_107)) (<= |v_mult_#in~n_1204| v_mult_~n_BEFORE_CALL_107))) (< c_mult_~n |v_mult_#in~n_1314|) (<= (+ v_mult_~n_BEFORE_CALL_108 v_mult_~n_BEFORE_CALL_107 (* 2 |v_mult_#in~n_1317|) c_mult_~n (* 3 |v_mult_#in~n_1314|)) 2147483647) (< |v_mult_#in~n_1314| |v_mult_#in~n_1317|))) is different from false [2021-11-07 02:03:06,936 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_107, v_mult_~n_BEFORE_CALL_108, |v_mult_#in~n_BEFORE_CALL_68|] [2021-11-07 02:03:06,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1420115606] [2021-11-07 02:03:06,938 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:03:06,938 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:03:06,939 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:609) 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-07 02:03:06,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:03:06,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2021-11-07 02:03:06,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071648698] [2021-11-07 02:03:06,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-07 02:03:06,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:06,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-07 02:03:06,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1578, Unknown=5, NotChecked=246, Total=1980 [2021-11-07 02:03:06,954 INFO L87 Difference]: Start difference. First operand 186 states and 206 transitions. Second operand has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 10 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-07 02:03:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:09,549 INFO L93 Difference]: Finished difference Result 247 states and 270 transitions. [2021-11-07 02:03:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-07 02:03:09,559 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 10 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) Word has length 124 [2021-11-07 02:03:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:09,561 INFO L225 Difference]: With dead ends: 247 [2021-11-07 02:03:09,562 INFO L226 Difference]: Without dead ends: 244 [2021-11-07 02:03:09,564 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 126 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=571, Invalid=5136, Unknown=5, NotChecked=450, Total=6162 [2021-11-07 02:03:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-07 02:03:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 191. [2021-11-07 02:03:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.0460526315789473) internal successors, (159), 151 states have internal predecessors, (159), 9 states have call successors, (9), 6 states have call predecessors, (9), 29 states have return successors, (43), 33 states have call predecessors, (43), 7 states have call successors, (43) [2021-11-07 02:03:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2021-11-07 02:03:09,577 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 124 [2021-11-07 02:03:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:09,577 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2021-11-07 02:03:09,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 10 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-07 02:03:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2021-11-07 02:03:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-07 02:03:09,580 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:09,580 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 9, 8, 8, 8, 8, 8, 8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:03:09,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-07 02:03:09,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-07 02:03:09,796 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:03:09,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1432828361, now seen corresponding path program 6 times [2021-11-07 02:03:09,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:09,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191948257] [2021-11-07 02:03:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:09,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 145 proven. 113 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-11-07 02:03:10,196 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:10,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191948257] [2021-11-07 02:03:10,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191948257] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:03:10,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397930588] [2021-11-07 02:03:10,197 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:03:10,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:03:10,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:03:10,199 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:03:10,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-07 02:03:11,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:03:11,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:03:11,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-07 02:03:11,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:03:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 3 proven. 270 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-11-07 02:03:12,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:03:35,728 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_117, |aux_div_v_mult_#t~ret8_AFTER_RETURN_36_100|] [2021-11-07 02:03:35,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [782952150] [2021-11-07 02:03:35,730 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:03:35,730 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:03:35,731 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:609) 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-07 02:03:35,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:03:35,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-11-07 02:03:35,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976921103] [2021-11-07 02:03:35,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-07 02:03:35,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:35,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-07 02:03:35,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1390, Unknown=9, NotChecked=0, Total=1560 [2021-11-07 02:03:35,734 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-07 02:03:36,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:36,948 INFO L93 Difference]: Finished difference Result 221 states and 241 transitions. [2021-11-07 02:03:36,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-07 02:03:36,949 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 101 [2021-11-07 02:03:36,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:36,951 INFO L225 Difference]: With dead ends: 221 [2021-11-07 02:03:36,951 INFO L226 Difference]: Without dead ends: 218 [2021-11-07 02:03:36,952 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=424, Invalid=3473, Unknown=9, NotChecked=0, Total=3906 [2021-11-07 02:03:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-07 02:03:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 196. [2021-11-07 02:03:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 156 states have (on average 1.044871794871795) internal successors, (163), 155 states have internal predecessors, (163), 9 states have call successors, (9), 6 states have call predecessors, (9), 30 states have return successors, (44), 34 states have call predecessors, (44), 7 states have call successors, (44) [2021-11-07 02:03:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2021-11-07 02:03:36,970 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 101 [2021-11-07 02:03:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:36,970 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2021-11-07 02:03:36,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-07 02:03:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2021-11-07 02:03:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-07 02:03:36,973 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:36,974 INFO L513 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1] [2021-11-07 02:03:37,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-07 02:03:37,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-07 02:03:37,188 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:03:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash 708108154, now seen corresponding path program 7 times [2021-11-07 02:03:37,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:37,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086373437] [2021-11-07 02:03:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:37,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2021-11-07 02:03:38,015 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:38,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086373437] [2021-11-07 02:03:38,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086373437] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:03:38,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943525932] [2021-11-07 02:03:38,016 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 02:03:38,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:03:38,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:03:38,017 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:03:38,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-07 02:03:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:38,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-07 02:03:38,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:03:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2021-11-07 02:03:40,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:03:48,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_133] [2021-11-07 02:03:48,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [705793028] [2021-11-07 02:03:48,510 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:03:48,511 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:03:48,511 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:609) 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-07 02:03:48,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:03:48,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2021-11-07 02:03:48,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435384527] [2021-11-07 02:03:48,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-07 02:03:48,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:48,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-07 02:03:48,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2080, Unknown=0, NotChecked=0, Total=2256 [2021-11-07 02:03:48,515 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 3 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-07 02:03:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:51,973 INFO L93 Difference]: Finished difference Result 316 states and 350 transitions. [2021-11-07 02:03:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-11-07 02:03:51,974 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 3 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) Word has length 150 [2021-11-07 02:03:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:51,976 INFO L225 Difference]: With dead ends: 316 [2021-11-07 02:03:51,976 INFO L226 Difference]: Without dead ends: 315 [2021-11-07 02:03:51,978 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 146 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=678, Invalid=9024, Unknown=0, NotChecked=0, Total=9702 [2021-11-07 02:03:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-07 02:03:51,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 201. [2021-11-07 02:03:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.04375) internal successors, (167), 159 states have internal predecessors, (167), 9 states have call successors, (9), 6 states have call predecessors, (9), 31 states have return successors, (46), 35 states have call predecessors, (46), 7 states have call successors, (46) [2021-11-07 02:03:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 222 transitions. [2021-11-07 02:03:51,991 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 222 transitions. Word has length 150 [2021-11-07 02:03:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:51,992 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 222 transitions. [2021-11-07 02:03:51,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 3 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-07 02:03:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 222 transitions. [2021-11-07 02:03:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-07 02:03:51,994 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:51,995 INFO L513 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 10, 10, 10, 10, 10, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:03:52,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-07 02:03:52,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:03:52,220 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:03:52,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash 380679577, now seen corresponding path program 7 times [2021-11-07 02:03:52,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:52,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268603513] [2021-11-07 02:03:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:52,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 2 proven. 370 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-11-07 02:03:52,927 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:52,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268603513] [2021-11-07 02:03:52,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268603513] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:03:52,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855217118] [2021-11-07 02:03:52,928 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 02:03:52,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:03:52,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:03:52,929 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:03:52,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-07 02:03:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:53,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-07 02:03:53,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:03:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 2 proven. 370 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-11-07 02:03:55,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:03:59,801 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_144] [2021-11-07 02:03:59,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [546426432] [2021-11-07 02:03:59,803 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:03:59,803 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:03:59,803 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:609) 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-07 02:03:59,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:03:59,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2021-11-07 02:03:59,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808910974] [2021-11-07 02:03:59,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-07 02:03:59,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:59,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-07 02:03:59,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1575, Unknown=0, NotChecked=0, Total=1722 [2021-11-07 02:03:59,807 INFO L87 Difference]: Start difference. First operand 201 states and 222 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 11 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-07 02:04:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:04:02,932 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2021-11-07 02:04:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-07 02:04:02,933 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 11 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) Word has length 123 [2021-11-07 02:04:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:04:02,936 INFO L225 Difference]: With dead ends: 267 [2021-11-07 02:04:02,936 INFO L226 Difference]: Without dead ends: 264 [2021-11-07 02:04:02,937 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 120 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=578, Invalid=5742, Unknown=0, NotChecked=0, Total=6320 [2021-11-07 02:04:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-07 02:04:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 206. [2021-11-07 02:04:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.0426829268292683) internal successors, (171), 163 states have internal predecessors, (171), 9 states have call successors, (9), 6 states have call predecessors, (9), 32 states have return successors, (47), 36 states have call predecessors, (47), 7 states have call successors, (47) [2021-11-07 02:04:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2021-11-07 02:04:02,952 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 123 [2021-11-07 02:04:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:04:02,952 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2021-11-07 02:04:02,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 11 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-07 02:04:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2021-11-07 02:04:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-07 02:04:02,955 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:04:02,956 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 11, 11, 11, 11, 10, 9, 9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:04:03,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-07 02:04:03,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:04:03,184 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:04:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:04:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1510278227, now seen corresponding path program 8 times [2021-11-07 02:04:03,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:04:03,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945365949] [2021-11-07 02:04:03,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:04:03,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:04:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:04:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 199 proven. 228 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-11-07 02:04:03,665 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:04:03,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945365949] [2021-11-07 02:04:03,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945365949] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:04:03,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365311454] [2021-11-07 02:04:03,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:04:03,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:04:03,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:04:03,667 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:04:03,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-07 02:04:05,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-11-07 02:04:05,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:04:05,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-07 02:04:05,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:04:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 199 proven. 228 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-11-07 02:04:05,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:04:09,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_155] [2021-11-07 02:04:09,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [625796082] [2021-11-07 02:04:09,057 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:04:09,057 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:04:09,058 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:609) 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-07 02:04:09,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:04:09,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2021-11-07 02:04:09,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988748107] [2021-11-07 02:04:09,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-07 02:04:09,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:04:09,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-07 02:04:09,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 02:04:09,061 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-07 02:04:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:04:10,485 INFO L93 Difference]: Finished difference Result 241 states and 262 transitions. [2021-11-07 02:04:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-07 02:04:10,494 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 124 [2021-11-07 02:04:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:04:10,496 INFO L225 Difference]: With dead ends: 241 [2021-11-07 02:04:10,497 INFO L226 Difference]: Without dead ends: 238 [2021-11-07 02:04:10,497 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 125 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=374, Invalid=3166, Unknown=0, NotChecked=0, Total=3540 [2021-11-07 02:04:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-07 02:04:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 211. [2021-11-07 02:04:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 168 states have (on average 1.0416666666666667) internal successors, (175), 167 states have internal predecessors, (175), 9 states have call successors, (9), 6 states have call predecessors, (9), 33 states have return successors, (48), 37 states have call predecessors, (48), 7 states have call successors, (48) [2021-11-07 02:04:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 232 transitions. [2021-11-07 02:04:10,509 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 232 transitions. Word has length 124 [2021-11-07 02:04:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:04:10,509 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 232 transitions. [2021-11-07 02:04:10,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2021-11-07 02:04:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 232 transitions. [2021-11-07 02:04:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-07 02:04:10,512 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:04:10,512 INFO L513 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1] [2021-11-07 02:04:10,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-07 02:04:10,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:04:10,736 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:04:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:04:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1727115348, now seen corresponding path program 8 times [2021-11-07 02:04:10,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:04:10,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103778472] [2021-11-07 02:04:10,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:04:10,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:04:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:04:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 627 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2021-11-07 02:04:11,518 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:04:11,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103778472] [2021-11-07 02:04:11,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103778472] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:04:11,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967337139] [2021-11-07 02:04:11,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:04:11,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:04:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:04:11,520 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:04:11,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-07 02:04:12,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-11-07 02:04:12,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:04:12,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-07 02:04:12,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:04:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 627 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2021-11-07 02:04:14,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:04:22,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_172 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_172 |c_mult_#res|) 2147483647) (exists ((|aux_div_v_mult_#in~n_2319_112| Int) (|v_mult_#in~n_2317| Int)) (let ((.cse1 (* 2 |aux_div_v_mult_#in~n_2319_112|)) (.cse0 (div (+ (* |v_mult_#in~n_2317| (- 2)) 2147483647 (* v_mult_~n_BEFORE_CALL_172 (- 2))) 3))) (and (< |aux_div_v_mult_#in~n_2319_112| v_mult_~n_BEFORE_CALL_172) (<= |v_mult_#in~n_2317| v_mult_~n_BEFORE_CALL_172) (< .cse0 (+ v_mult_~n_BEFORE_CALL_172 .cse1 2)) (<= (+ .cse1 |v_mult_#in~n_2317|) .cse0)))) (< v_mult_~n_BEFORE_CALL_172 |c_mult_#in~n|))) is different from false [2021-11-07 02:04:24,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_172 Int)) (or (exists ((|aux_div_v_mult_#in~n_2319_112| Int) (|v_mult_#in~n_2317| Int)) (let ((.cse1 (* 2 |aux_div_v_mult_#in~n_2319_112|)) (.cse0 (div (+ (* |v_mult_#in~n_2317| (- 2)) 2147483647 (* v_mult_~n_BEFORE_CALL_172 (- 2))) 3))) (and (< |aux_div_v_mult_#in~n_2319_112| v_mult_~n_BEFORE_CALL_172) (<= |v_mult_#in~n_2317| v_mult_~n_BEFORE_CALL_172) (< .cse0 (+ v_mult_~n_BEFORE_CALL_172 .cse1 2)) (<= (+ .cse1 |v_mult_#in~n_2317|) .cse0)))) (< v_mult_~n_BEFORE_CALL_172 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_172 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from false [2021-11-07 02:04:31,168 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_2519| Int) (|v_mult_#in~n_2528| Int) (v_mult_~n_BEFORE_CALL_172 Int)) (or (< |v_mult_#in~n_2519| |v_mult_#in~n_2528|) (< c_mult_~n |v_mult_#in~n_2519|) (<= (+ v_mult_~n_BEFORE_CALL_172 (* 6 c_mult_~n) (* 3 |v_mult_#in~n_2528|) (* 3 |v_mult_#in~n_2519|)) 2147483647) (exists ((|aux_div_v_mult_#in~n_2319_112| Int) (|v_mult_#in~n_2317| Int)) (let ((.cse1 (* 2 |aux_div_v_mult_#in~n_2319_112|)) (.cse0 (div (+ (* |v_mult_#in~n_2317| (- 2)) 2147483647 (* v_mult_~n_BEFORE_CALL_172 (- 2))) 3))) (and (< |aux_div_v_mult_#in~n_2319_112| v_mult_~n_BEFORE_CALL_172) (<= |v_mult_#in~n_2317| v_mult_~n_BEFORE_CALL_172) (< .cse0 (+ v_mult_~n_BEFORE_CALL_172 .cse1 2)) (<= (+ .cse1 |v_mult_#in~n_2317|) .cse0)))) (< v_mult_~n_BEFORE_CALL_172 |c_mult_#in~n|))) is different from false [2021-11-07 02:04:31,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_172] [2021-11-07 02:04:31,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1672253774] [2021-11-07 02:04:31,179 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:04:31,179 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:04:31,180 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:609) 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-07 02:04:31,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:04:31,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-11-07 02:04:31,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453819050] [2021-11-07 02:04:31,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-07 02:04:31,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:04:31,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-07 02:04:31,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2134, Unknown=3, NotChecked=282, Total=2550 [2021-11-07 02:04:31,183 INFO L87 Difference]: Start difference. First operand 211 states and 232 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-07 02:04:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:04:35,044 INFO L93 Difference]: Finished difference Result 336 states and 371 transitions. [2021-11-07 02:04:35,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-07 02:04:35,044 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) Word has length 161 [2021-11-07 02:04:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:04:35,047 INFO L225 Difference]: With dead ends: 336 [2021-11-07 02:04:35,047 INFO L226 Difference]: Without dead ends: 335 [2021-11-07 02:04:35,049 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 156 SyntacticMatches, 11 SemanticMatches, 104 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=562, Invalid=9953, Unknown=3, NotChecked=612, Total=11130 [2021-11-07 02:04:35,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-11-07 02:04:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 216. [2021-11-07 02:04:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 172 states have (on average 1.0406976744186047) internal successors, (179), 171 states have internal predecessors, (179), 9 states have call successors, (9), 6 states have call predecessors, (9), 34 states have return successors, (50), 38 states have call predecessors, (50), 7 states have call successors, (50) [2021-11-07 02:04:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 238 transitions. [2021-11-07 02:04:35,064 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 238 transitions. Word has length 161 [2021-11-07 02:04:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:04:35,065 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 238 transitions. [2021-11-07 02:04:35,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-07 02:04:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 238 transitions. [2021-11-07 02:04:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-07 02:04:35,067 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:04:35,068 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 12, 11, 11, 11, 11, 11, 11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:04:35,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-07 02:04:35,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-07 02:04:35,272 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:04:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:04:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1988880751, now seen corresponding path program 9 times [2021-11-07 02:04:35,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:04:35,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513948165] [2021-11-07 02:04:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:04:35,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:04:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:04:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 2 proven. 436 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-11-07 02:04:35,932 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:04:35,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513948165] [2021-11-07 02:04:35,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513948165] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:04:35,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66398366] [2021-11-07 02:04:35,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:04:35,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:04:35,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:04:35,933 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:04:35,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-07 02:04:37,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:04:37,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:04:37,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-07 02:04:37,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:04:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 2 proven. 436 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-11-07 02:04:38,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:04:44,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_184] [2021-11-07 02:04:44,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [377618519] [2021-11-07 02:04:44,083 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:04:44,083 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:04:44,084 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:609) 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-07 02:04:44,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:04:44,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2021-11-07 02:04:44,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807221202] [2021-11-07 02:04:44,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-07 02:04:44,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:04:44,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-07 02:04:44,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2021-11-07 02:04:44,092 INFO L87 Difference]: Start difference. First operand 216 states and 238 transitions. Second operand has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 12 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-07 02:04:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:04:47,810 INFO L93 Difference]: Finished difference Result 287 states and 312 transitions. [2021-11-07 02:04:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-07 02:04:47,811 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 12 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) Word has length 134 [2021-11-07 02:04:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:04:47,814 INFO L225 Difference]: With dead ends: 287 [2021-11-07 02:04:47,814 INFO L226 Difference]: Without dead ends: 284 [2021-11-07 02:04:47,816 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 130 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=635, Invalid=6847, Unknown=0, NotChecked=0, Total=7482 [2021-11-07 02:04:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-07 02:04:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 221. [2021-11-07 02:04:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 176 states have (on average 1.0397727272727273) internal successors, (183), 175 states have internal predecessors, (183), 9 states have call successors, (9), 6 states have call predecessors, (9), 35 states have return successors, (51), 39 states have call predecessors, (51), 7 states have call successors, (51) [2021-11-07 02:04:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2021-11-07 02:04:47,831 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 134 [2021-11-07 02:04:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:04:47,832 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 243 transitions. [2021-11-07 02:04:47,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 12 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-07 02:04:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 243 transitions. [2021-11-07 02:04:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-07 02:04:47,835 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:04:47,836 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 11, 10, 10, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:04:47,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-07 02:04:48,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-07 02:04:48,050 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:04:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:04:48,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1814732827, now seen corresponding path program 10 times [2021-11-07 02:04:48,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:04:48,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520670375] [2021-11-07 02:04:48,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:04:48,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:04:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:04:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 223 proven. 282 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2021-11-07 02:04:48,625 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:04:48,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520670375] [2021-11-07 02:04:48,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520670375] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:04:48,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147778674] [2021-11-07 02:04:48,625 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 02:04:48,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:04:48,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:04:48,626 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:04:48,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-07 02:04:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:04:50,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-07 02:04:50,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:04:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 9 proven. 511 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-11-07 02:04:51,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:04:56,867 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_196] [2021-11-07 02:04:56,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1468871014] [2021-11-07 02:04:56,869 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:04:56,869 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:04:56,869 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) 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-07 02:04:56,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:04:56,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-07 02:04:56,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856976703] [2021-11-07 02:04:56,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-07 02:04:56,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:04:56,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-07 02:04:56,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1654, Unknown=1, NotChecked=0, Total=1806 [2021-11-07 02:04:56,871 INFO L87 Difference]: Start difference. First operand 221 states and 243 transitions. Second operand has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (6), 2 states have call predecessors, (6), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-07 02:04:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:04:58,804 INFO L93 Difference]: Finished difference Result 261 states and 283 transitions. [2021-11-07 02:04:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-07 02:04:58,804 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (6), 2 states have call predecessors, (6), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) Word has length 135 [2021-11-07 02:04:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:04:58,806 INFO L225 Difference]: With dead ends: 261 [2021-11-07 02:04:58,806 INFO L226 Difference]: Without dead ends: 258 [2021-11-07 02:04:58,806 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=447, Invalid=4954, Unknown=1, NotChecked=0, Total=5402 [2021-11-07 02:04:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-07 02:04:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 226. [2021-11-07 02:04:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 180 states have (on average 1.038888888888889) internal successors, (187), 179 states have internal predecessors, (187), 9 states have call successors, (9), 6 states have call predecessors, (9), 36 states have return successors, (52), 40 states have call predecessors, (52), 7 states have call successors, (52) [2021-11-07 02:04:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2021-11-07 02:04:58,817 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 135 [2021-11-07 02:04:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:04:58,818 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2021-11-07 02:04:58,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (6), 2 states have call predecessors, (6), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-07 02:04:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2021-11-07 02:04:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-07 02:04:58,820 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:04:58,820 INFO L513 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1] [2021-11-07 02:04:58,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-07 02:04:59,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:04:59,036 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:04:59,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:04:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 303260412, now seen corresponding path program 9 times [2021-11-07 02:04:59,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:04:59,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412905857] [2021-11-07 02:04:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:04:59,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:04:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:04:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 711 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2021-11-07 02:04:59,862 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:04:59,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412905857] [2021-11-07 02:04:59,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412905857] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:04:59,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882640340] [2021-11-07 02:04:59,863 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:04:59,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:04:59,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:04:59,863 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:04:59,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-07 02:05:01,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:05:01,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:05:01,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-07 02:05:01,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:05:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 711 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2021-11-07 02:05:03,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:05:10,945 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_214 Int)) (or (exists ((|v_mult_#in~n_3189| Int) (|v_mult_#in~n_3190| Int)) (and (<= |v_mult_#in~n_3190| |v_mult_#in~n_3189|) (< (div (+ 2147483647 (* v_mult_~n_BEFORE_CALL_214 (- 5)) (* |v_mult_#in~n_3190| (- 3))) 2) (+ v_mult_~n_BEFORE_CALL_214 (* 2 |v_mult_#in~n_3189|))) (<= |v_mult_#in~n_3189| v_mult_~n_BEFORE_CALL_214))) (< v_mult_~n_BEFORE_CALL_214 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_214 |c_mult_#res|) 2147483647))) is different from false [2021-11-07 02:05:18,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_214] [2021-11-07 02:05:18,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [437439820] [2021-11-07 02:05:18,663 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:05:18,663 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:05:18,664 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:609) 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-07 02:05:18,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:05:18,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2021-11-07 02:05:18,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003371462] [2021-11-07 02:05:18,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-07 02:05:18,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:18,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-07 02:05:18,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2574, Unknown=1, NotChecked=102, Total=2862 [2021-11-07 02:05:18,667 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 3 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (14), 14 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-07 02:05:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:22,443 INFO L93 Difference]: Finished difference Result 356 states and 392 transitions. [2021-11-07 02:05:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-07 02:05:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 3 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (14), 14 states have call predecessors, (14), 2 states have call successors, (14) Word has length 172 [2021-11-07 02:05:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:22,445 INFO L225 Difference]: With dead ends: 356 [2021-11-07 02:05:22,445 INFO L226 Difference]: Without dead ends: 355 [2021-11-07 02:05:22,447 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 166 SyntacticMatches, 12 SemanticMatches, 111 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2749 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=735, Invalid=11700, Unknown=1, NotChecked=220, Total=12656 [2021-11-07 02:05:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-11-07 02:05:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 231. [2021-11-07 02:05:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 184 states have (on average 1.0380434782608696) internal successors, (191), 183 states have internal predecessors, (191), 9 states have call successors, (9), 6 states have call predecessors, (9), 37 states have return successors, (54), 41 states have call predecessors, (54), 7 states have call successors, (54) [2021-11-07 02:05:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2021-11-07 02:05:22,460 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 172 [2021-11-07 02:05:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:22,461 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2021-11-07 02:05:22,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 3 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (14), 14 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-07 02:05:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2021-11-07 02:05:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-07 02:05:22,463 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:22,464 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 13, 12, 12, 12, 12, 12, 12, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:22,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-07 02:05:22,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-07 02:05:22,680 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:05:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash -321490601, now seen corresponding path program 11 times [2021-11-07 02:05:22,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:22,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023996252] [2021-11-07 02:05:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:22,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 2 proven. 507 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2021-11-07 02:05:23,503 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:23,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023996252] [2021-11-07 02:05:23,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023996252] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:05:23,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198377828] [2021-11-07 02:05:23,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:05:23,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:05:23,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:05:23,504 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:05:23,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-07 02:05:25,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-11-07 02:05:25,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:05:25,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-07 02:05:25,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:05:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 48 proven. 505 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-11-07 02:05:27,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:05:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 87 proven. 507 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-11-07 02:05:33,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198377828] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 02:05:33,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [533487655] [2021-11-07 02:05:33,330 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:05:33,330 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:05:33,330 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:609) 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-07 02:05:33,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 02:05:33,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 34] total 82 [2021-11-07 02:05:33,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596453745] [2021-11-07 02:05:33,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2021-11-07 02:05:33,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:05:33,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2021-11-07 02:05:33,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=6520, Unknown=0, NotChecked=0, Total=6806 [2021-11-07 02:05:33,333 INFO L87 Difference]: Start difference. First operand 231 states and 254 transitions. Second operand has 83 states, 82 states have (on average 2.3902439024390243) internal successors, (196), 78 states have internal predecessors, (196), 13 states have call successors, (14), 4 states have call predecessors, (14), 28 states have return successors, (39), 39 states have call predecessors, (39), 10 states have call successors, (39) [2021-11-07 02:05:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:05:46,367 INFO L93 Difference]: Finished difference Result 416 states and 458 transitions. [2021-11-07 02:05:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-11-07 02:05:46,368 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 2.3902439024390243) internal successors, (196), 78 states have internal predecessors, (196), 13 states have call successors, (14), 4 states have call predecessors, (14), 28 states have return successors, (39), 39 states have call predecessors, (39), 10 states have call successors, (39) Word has length 145 [2021-11-07 02:05:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:05:46,370 INFO L225 Difference]: With dead ends: 416 [2021-11-07 02:05:46,371 INFO L226 Difference]: Without dead ends: 399 [2021-11-07 02:05:46,374 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 242 SyntacticMatches, 8 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9326 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=3022, Invalid=30284, Unknown=0, NotChecked=0, Total=33306 [2021-11-07 02:05:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-11-07 02:05:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 246. [2021-11-07 02:05:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 196 states have (on average 1.0357142857142858) internal successors, (203), 195 states have internal predecessors, (203), 9 states have call successors, (9), 6 states have call predecessors, (9), 40 states have return successors, (57), 44 states have call predecessors, (57), 7 states have call successors, (57) [2021-11-07 02:05:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 269 transitions. [2021-11-07 02:05:46,389 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 269 transitions. Word has length 145 [2021-11-07 02:05:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:05:46,389 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 269 transitions. [2021-11-07 02:05:46,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 2.3902439024390243) internal successors, (196), 78 states have internal predecessors, (196), 13 states have call successors, (14), 4 states have call predecessors, (14), 28 states have return successors, (39), 39 states have call predecessors, (39), 10 states have call successors, (39) [2021-11-07 02:05:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 269 transitions. [2021-11-07 02:05:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-07 02:05:46,392 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:05:46,392 INFO L513 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1] [2021-11-07 02:05:46,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-07 02:05:46,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:05:46,615 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:05:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:05:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1917046826, now seen corresponding path program 10 times [2021-11-07 02:05:46,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:05:46,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898210791] [2021-11-07 02:05:46,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:05:46,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:05:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2021-11-07 02:05:47,571 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:05:47,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898210791] [2021-11-07 02:05:47,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898210791] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:05:47,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887441096] [2021-11-07 02:05:47,572 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 02:05:47,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:05:47,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:05:47,573 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:05:47,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-07 02:05:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:05:49,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-07 02:05:49,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:05:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2021-11-07 02:05:51,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:06:07,960 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_254 Int)) (or (exists ((|v_mult_#in~n_3978| Int) (|v_mult_#in~n_3987| Int)) (and (<= |v_mult_#in~n_3978| v_mult_~n_BEFORE_CALL_254) (< (div (div (+ (* v_mult_~n_BEFORE_CALL_254 (- 5)) 2147483647 (* |v_mult_#in~n_3978| (- 3)) (* |v_mult_#in~n_3987| (- 3))) 2) 2) v_mult_~n_BEFORE_CALL_254) (<= |v_mult_#in~n_3987| |v_mult_#in~n_3978|))) (< v_mult_~n_BEFORE_CALL_254 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_254 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from false [2021-11-07 02:06:17,442 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_254] [2021-11-07 02:06:17,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1392343251] [2021-11-07 02:06:17,443 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:06:17,443 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:06:17,444 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:609) 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-07 02:06:17,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:06:17,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2021-11-07 02:06:17,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309515440] [2021-11-07 02:06:17,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-07 02:06:17,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:06:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-07 02:06:17,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2898, Unknown=4, NotChecked=108, Total=3192 [2021-11-07 02:06:17,454 INFO L87 Difference]: Start difference. First operand 246 states and 269 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (4), 2 states have call predecessors, (4), 15 states have return successors, (15), 15 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-07 02:06:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:06:21,726 INFO L93 Difference]: Finished difference Result 379 states and 413 transitions. [2021-11-07 02:06:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-11-07 02:06:21,726 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (4), 2 states have call predecessors, (4), 15 states have return successors, (15), 15 states have call predecessors, (15), 2 states have call successors, (15) Word has length 183 [2021-11-07 02:06:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:06:21,728 INFO L225 Difference]: With dead ends: 379 [2021-11-07 02:06:21,728 INFO L226 Difference]: Without dead ends: 378 [2021-11-07 02:06:21,729 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 176 SyntacticMatches, 13 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3189 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=786, Invalid=13494, Unknown=4, NotChecked=236, Total=14520 [2021-11-07 02:06:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-11-07 02:06:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 251. [2021-11-07 02:06:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 200 states have (on average 1.035) internal successors, (207), 199 states have internal predecessors, (207), 9 states have call successors, (9), 6 states have call predecessors, (9), 41 states have return successors, (59), 45 states have call predecessors, (59), 7 states have call successors, (59) [2021-11-07 02:06:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 275 transitions. [2021-11-07 02:06:21,743 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 275 transitions. Word has length 183 [2021-11-07 02:06:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:06:21,743 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 275 transitions. [2021-11-07 02:06:21,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (4), 2 states have call predecessors, (4), 15 states have return successors, (15), 15 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-07 02:06:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 275 transitions. [2021-11-07 02:06:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-07 02:06:21,745 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:06:21,746 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 13, 12, 12, 12, 12, 12, 12, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:06:21,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-07 02:06:21,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-07 02:06:21,960 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:06:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:06:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1703029993, now seen corresponding path program 12 times [2021-11-07 02:06:21,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:06:21,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878493780] [2021-11-07 02:06:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:06:21,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:06:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:06:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 307 proven. 239 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-11-07 02:06:22,440 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:06:22,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878493780] [2021-11-07 02:06:22,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878493780] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:06:22,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403893469] [2021-11-07 02:06:22,440 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:06:22,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:06:22,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:06:22,442 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:06:22,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-07 02:06:24,505 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:06:24,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:06:24,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-07 02:06:24,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:06:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 4 proven. 571 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-11-07 02:06:25,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:06:29,720 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_265] [2021-11-07 02:06:29,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2059252520] [2021-11-07 02:06:29,721 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:06:29,721 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:06:29,721 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:609) 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-07 02:06:29,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:06:29,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2021-11-07 02:06:29,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839416850] [2021-11-07 02:06:29,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-07 02:06:29,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:06:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-07 02:06:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1994, Unknown=0, NotChecked=0, Total=2162 [2021-11-07 02:06:29,722 INFO L87 Difference]: Start difference. First operand 251 states and 275 transitions. Second operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 10 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-07 02:06:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:06:31,775 INFO L93 Difference]: Finished difference Result 296 states and 320 transitions. [2021-11-07 02:06:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-07 02:06:31,775 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 10 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) Word has length 145 [2021-11-07 02:06:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:06:31,780 INFO L225 Difference]: With dead ends: 296 [2021-11-07 02:06:31,781 INFO L226 Difference]: Without dead ends: 293 [2021-11-07 02:06:31,783 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=502, Invalid=6140, Unknown=0, NotChecked=0, Total=6642 [2021-11-07 02:06:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-07 02:06:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 256. [2021-11-07 02:06:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 204 states have (on average 1.0343137254901962) internal successors, (211), 203 states have internal predecessors, (211), 9 states have call successors, (9), 6 states have call predecessors, (9), 42 states have return successors, (60), 46 states have call predecessors, (60), 7 states have call successors, (60) [2021-11-07 02:06:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 280 transitions. [2021-11-07 02:06:31,799 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 280 transitions. Word has length 145 [2021-11-07 02:06:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:06:31,800 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 280 transitions. [2021-11-07 02:06:31,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 10 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-07 02:06:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 280 transitions. [2021-11-07 02:06:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-07 02:06:31,803 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:06:31,803 INFO L513 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1] [2021-11-07 02:06:31,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-07 02:06:32,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-07 02:06:32,016 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:06:32,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:06:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 106899070, now seen corresponding path program 11 times [2021-11-07 02:06:32,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:06:32,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796997663] [2021-11-07 02:06:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:06:32,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:06:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:06:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 0 proven. 894 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2021-11-07 02:06:33,401 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:06:33,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796997663] [2021-11-07 02:06:33,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796997663] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:06:33,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596324806] [2021-11-07 02:06:33,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:06:33,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:06:33,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:06:33,403 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:06:33,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-07 02:06:35,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2021-11-07 02:06:35,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:06:35,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-07 02:06:35,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:06:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 0 proven. 894 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2021-11-07 02:06:38,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:13,474 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_285] [2021-11-07 02:07:13,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [314219092] [2021-11-07 02:07:13,476 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:07:13,476 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:07:13,476 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:609) 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-07 02:07:13,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:07:13,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2021-11-07 02:07:13,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889200685] [2021-11-07 02:07:13,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-07 02:07:13,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:13,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-07 02:07:13,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3311, Unknown=5, NotChecked=0, Total=3540 [2021-11-07 02:07:13,479 INFO L87 Difference]: Start difference. First operand 256 states and 280 transitions. Second operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 3 states have call successors, (4), 2 states have call predecessors, (4), 16 states have return successors, (16), 16 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-07 02:07:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:18,682 INFO L93 Difference]: Finished difference Result 399 states and 436 transitions. [2021-11-07 02:07:18,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-07 02:07:18,683 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 3 states have call successors, (4), 2 states have call predecessors, (4), 16 states have return successors, (16), 16 states have call predecessors, (16), 2 states have call successors, (16) Word has length 194 [2021-11-07 02:07:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:18,686 INFO L225 Difference]: With dead ends: 399 [2021-11-07 02:07:18,686 INFO L226 Difference]: Without dead ends: 398 [2021-11-07 02:07:18,689 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 186 SyntacticMatches, 14 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3648 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=899, Invalid=15352, Unknown=5, NotChecked=0, Total=16256 [2021-11-07 02:07:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-07 02:07:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 261. [2021-11-07 02:07:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 208 states have (on average 1.0336538461538463) internal successors, (215), 207 states have internal predecessors, (215), 9 states have call successors, (9), 6 states have call predecessors, (9), 43 states have return successors, (62), 47 states have call predecessors, (62), 7 states have call successors, (62) [2021-11-07 02:07:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 286 transitions. [2021-11-07 02:07:18,706 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 286 transitions. Word has length 194 [2021-11-07 02:07:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:18,707 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 286 transitions. [2021-11-07 02:07:18,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 37 states have internal predecessors, (79), 3 states have call successors, (4), 2 states have call predecessors, (4), 16 states have return successors, (16), 16 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-07 02:07:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 286 transitions. [2021-11-07 02:07:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-07 02:07:18,710 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:18,710 INFO L513 BasicCegarLoop]: trace histogram [15, 15, 14, 13, 13, 13, 13, 13, 13, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:18,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-07 02:07:18,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-07 02:07:18,932 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:07:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:18,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1774850353, now seen corresponding path program 13 times [2021-11-07 02:07:18,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:18,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090474495] [2021-11-07 02:07:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:18,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 341 proven. 291 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2021-11-07 02:07:19,652 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:19,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090474495] [2021-11-07 02:07:19,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090474495] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:07:19,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026428441] [2021-11-07 02:07:19,652 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 02:07:19,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:07:19,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:07:19,656 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:07:19,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-07 02:07:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:22,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-07 02:07:22,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 4 proven. 657 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2021-11-07 02:07:24,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:07:31,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_297] [2021-11-07 02:07:31,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [805027658] [2021-11-07 02:07:31,286 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:07:31,286 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:07:31,287 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:609) 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-07 02:07:31,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:07:31,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-11-07 02:07:31,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268033174] [2021-11-07 02:07:31,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-07 02:07:31,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:07:31,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-07 02:07:31,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2269, Unknown=1, NotChecked=0, Total=2450 [2021-11-07 02:07:31,290 INFO L87 Difference]: Start difference. First operand 261 states and 286 transitions. Second operand has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 11 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-07 02:07:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:07:34,280 INFO L93 Difference]: Finished difference Result 311 states and 336 transitions. [2021-11-07 02:07:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-07 02:07:34,280 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 11 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) Word has length 156 [2021-11-07 02:07:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:07:34,283 INFO L225 Difference]: With dead ends: 311 [2021-11-07 02:07:34,283 INFO L226 Difference]: Without dead ends: 308 [2021-11-07 02:07:34,284 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 142 SyntacticMatches, 8 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=552, Invalid=7279, Unknown=1, NotChecked=0, Total=7832 [2021-11-07 02:07:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-11-07 02:07:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 266. [2021-11-07 02:07:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 212 states have (on average 1.0330188679245282) internal successors, (219), 211 states have internal predecessors, (219), 9 states have call successors, (9), 6 states have call predecessors, (9), 44 states have return successors, (63), 48 states have call predecessors, (63), 7 states have call successors, (63) [2021-11-07 02:07:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 291 transitions. [2021-11-07 02:07:34,300 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 291 transitions. Word has length 156 [2021-11-07 02:07:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:07:34,300 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 291 transitions. [2021-11-07 02:07:34,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 11 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-07 02:07:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 291 transitions. [2021-11-07 02:07:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-11-07 02:07:34,303 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:07:34,304 INFO L513 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1] [2021-11-07 02:07:34,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-07 02:07:34,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:07:34,522 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:07:34,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:07:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash -236798454, now seen corresponding path program 12 times [2021-11-07 02:07:34,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:07:34,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616169337] [2021-11-07 02:07:34,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:07:34,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:07:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:07:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2021-11-07 02:07:35,994 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:07:35,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616169337] [2021-11-07 02:07:35,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616169337] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:07:35,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169154689] [2021-11-07 02:07:35,994 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:07:35,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:07:35,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:07:35,996 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:07:36,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-07 02:07:38,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:07:38,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:07:38,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-07 02:07:38,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:07:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2021-11-07 02:07:41,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:08:18,588 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_6159| Int) (|v_mult_#in~n_6156| Int) (|v_mult_#in~n_6157| Int) (|v_mult_#in~n_6151| Int) (aux_mod_v_mult_~n_BEFORE_CALL_316_166 Int) (aux_div_v_mult_~n_BEFORE_CALL_316_166 Int)) (or (< aux_mod_v_mult_~n_BEFORE_CALL_316_166 0) (< c_mult_~n |v_mult_#in~n_6159|) (<= (+ (* 2 |v_mult_#in~n_6159|) |v_mult_#in~n_6157|) aux_div_v_mult_~n_BEFORE_CALL_316_166) (< |v_mult_#in~n_6156| |v_mult_#in~n_6151|) (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_316_166) (< |v_mult_#in~n_6151| |v_mult_#in~n_6157|) (< |v_mult_#in~n_6159| |v_mult_#in~n_6156|) (< 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_316_166 (* 3 |v_mult_#in~n_6156|) |c_mult_#in~n| (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166) c_mult_~n (* 3 |v_mult_#in~n_6157|) (* 3 |v_mult_#in~n_6151|))) (exists ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (let ((.cse0 (* 3 |v_mult_#in~n_6156|)) (.cse1 (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166)) (.cse2 (* 3 |v_mult_#in~n_6157|)) (.cse3 (* 3 |v_mult_#in~n_6151|))) (and (<= |v_mult_#in~n_5784| |v_mult_#in~n_5787|) (<= |v_mult_#in~n_5788| |v_mult_#in~n_5784|) (< (+ (div (+ (* c_mult_~n 5) (* |v_mult_#in~n_6156| 15) (* aux_div_v_mult_~n_BEFORE_CALL_316_166 10) (* |v_mult_#in~n_6151| 15) (* |v_mult_#in~n_6157| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_316_166 5) (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (- 8589934588)) 2) aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse0 .cse1 c_mult_~n .cse2 .cse3) (+ 2147483647 (* 2 |v_mult_#in~n_5784|))) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse0 .cse1 c_mult_~n |v_mult_#in~n_5787| .cse2 .cse3) 2147483647)))))) is different from false [2021-11-07 02:08:30,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_234| Int) (v_mult_~n_BEFORE_CALL_316 Int) (v_mult_~n_BEFORE_CALL_317 Int)) (or (< v_mult_~n_BEFORE_CALL_317 |c_mult_#in~n|) (exists ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (and (<= |v_mult_#in~n_5784| |v_mult_#in~n_5787|) (<= |v_mult_#in~n_5788| |v_mult_#in~n_5784|) (<= |v_mult_#in~n_5787| v_mult_~n_BEFORE_CALL_316) (< (div (+ 2147483647 (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (* v_mult_~n_BEFORE_CALL_316 (- 5))) 2) (+ v_mult_~n_BEFORE_CALL_316 (* 2 |v_mult_#in~n_5784|))))) (<= (+ v_mult_~n_BEFORE_CALL_317 v_mult_~n_BEFORE_CALL_316 |c_mult_#res|) 2147483647) (< v_mult_~n_BEFORE_CALL_316 |v_mult_#in~n_BEFORE_CALL_234|) (exists ((|v_mult_#in~n_6159| Int) (|v_mult_#in~n_6156| Int) (|v_mult_#in~n_6157| Int) (|v_mult_#in~n_6151| Int) (aux_mod_v_mult_~n_BEFORE_CALL_316_166 Int) (aux_div_v_mult_~n_BEFORE_CALL_316_166 Int)) (and (<= |v_mult_#in~n_6157| |v_mult_#in~n_6151|) (<= |v_mult_#in~n_6156| |v_mult_#in~n_6159|) (< aux_mod_v_mult_~n_BEFORE_CALL_316_166 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_316_166) (forall ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (let ((.cse0 (* 3 |v_mult_#in~n_6156|)) (.cse1 (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166)) (.cse2 (* 3 |v_mult_#in~n_6157|)) (.cse3 (* 3 |v_mult_#in~n_6151|))) (or (< |v_mult_#in~n_5784| |v_mult_#in~n_5788|) (<= (+ 2147483647 (* 2 |v_mult_#in~n_5784|)) (+ v_mult_~n_BEFORE_CALL_317 (div (+ (* |v_mult_#in~n_6156| 15) (* aux_div_v_mult_~n_BEFORE_CALL_316_166 10) (* |v_mult_#in~n_6151| 15) (* v_mult_~n_BEFORE_CALL_317 5) (* |v_mult_#in~n_6157| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_316_166 5) (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (- 8589934588)) 2) aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse0 .cse1 .cse2 .cse3)) (< |v_mult_#in~n_5787| |v_mult_#in~n_5784|) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_317 aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse0 .cse1 |v_mult_#in~n_5787| .cse2 .cse3))))) (<= |v_mult_#in~n_6151| |v_mult_#in~n_6156|) (<= (+ v_mult_~n_BEFORE_CALL_317 aux_mod_v_mult_~n_BEFORE_CALL_316_166 |v_mult_#in~n_BEFORE_CALL_234| (* 3 |v_mult_#in~n_6156|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166) (* 3 |v_mult_#in~n_6157|) (* 3 |v_mult_#in~n_6151|)) 2147483647) (<= |v_mult_#in~n_6159| v_mult_~n_BEFORE_CALL_317) (< aux_div_v_mult_~n_BEFORE_CALL_316_166 (+ (* 2 |v_mult_#in~n_6159|) |v_mult_#in~n_6157|)))))) is different from false [2021-11-07 02:08:32,435 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_234| Int) (v_mult_~n_BEFORE_CALL_316 Int) (v_mult_~n_BEFORE_CALL_317 Int)) (or (< v_mult_~n_BEFORE_CALL_317 |c_mult_#in~n|) (exists ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (and (<= |v_mult_#in~n_5784| |v_mult_#in~n_5787|) (<= |v_mult_#in~n_5788| |v_mult_#in~n_5784|) (<= |v_mult_#in~n_5787| v_mult_~n_BEFORE_CALL_316) (< (div (+ 2147483647 (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (* v_mult_~n_BEFORE_CALL_316 (- 5))) 2) (+ v_mult_~n_BEFORE_CALL_316 (* 2 |v_mult_#in~n_5784|))))) (<= (+ v_mult_~n_BEFORE_CALL_317 v_mult_~n_BEFORE_CALL_316 |c_mult_#res|) 2147483647) (< v_mult_~n_BEFORE_CALL_316 |v_mult_#in~n_BEFORE_CALL_234|) (exists ((|v_mult_#in~n_6159| Int) (|v_mult_#in~n_6156| Int) (|v_mult_#in~n_6157| Int) (|v_mult_#in~n_6151| Int) (aux_mod_v_mult_~n_BEFORE_CALL_316_166 Int) (aux_div_v_mult_~n_BEFORE_CALL_316_166 Int)) (and (<= |v_mult_#in~n_6157| |v_mult_#in~n_6151|) (<= |v_mult_#in~n_6156| |v_mult_#in~n_6159|) (< aux_mod_v_mult_~n_BEFORE_CALL_316_166 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_316_166) (forall ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (let ((.cse0 (* 3 |v_mult_#in~n_6156|)) (.cse1 (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166)) (.cse2 (* 3 |v_mult_#in~n_6157|)) (.cse3 (* 3 |v_mult_#in~n_6151|))) (or (< |v_mult_#in~n_5784| |v_mult_#in~n_5788|) (<= (+ 2147483647 (* 2 |v_mult_#in~n_5784|)) (+ v_mult_~n_BEFORE_CALL_317 (div (+ (* |v_mult_#in~n_6156| 15) (* aux_div_v_mult_~n_BEFORE_CALL_316_166 10) (* |v_mult_#in~n_6151| 15) (* v_mult_~n_BEFORE_CALL_317 5) (* |v_mult_#in~n_6157| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_316_166 5) (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (- 8589934588)) 2) aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse0 .cse1 .cse2 .cse3)) (< |v_mult_#in~n_5787| |v_mult_#in~n_5784|) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_317 aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse0 .cse1 |v_mult_#in~n_5787| .cse2 .cse3))))) (<= |v_mult_#in~n_6151| |v_mult_#in~n_6156|) (<= (+ v_mult_~n_BEFORE_CALL_317 aux_mod_v_mult_~n_BEFORE_CALL_316_166 |v_mult_#in~n_BEFORE_CALL_234| (* 3 |v_mult_#in~n_6156|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166) (* 3 |v_mult_#in~n_6157|) (* 3 |v_mult_#in~n_6151|)) 2147483647) (<= |v_mult_#in~n_6159| v_mult_~n_BEFORE_CALL_317) (< aux_div_v_mult_~n_BEFORE_CALL_316_166 (+ (* 2 |v_mult_#in~n_6159|) |v_mult_#in~n_6157|)))))) is different from true [2021-11-07 02:08:54,570 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_234| Int) (v_mult_~n_BEFORE_CALL_316 Int) (v_mult_~n_BEFORE_CALL_317 Int)) (or (< v_mult_~n_BEFORE_CALL_317 |c_mult_#in~n|) (exists ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (and (<= |v_mult_#in~n_5784| |v_mult_#in~n_5787|) (<= |v_mult_#in~n_5788| |v_mult_#in~n_5784|) (<= |v_mult_#in~n_5787| v_mult_~n_BEFORE_CALL_316) (< (div (+ 2147483647 (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (* v_mult_~n_BEFORE_CALL_316 (- 5))) 2) (+ v_mult_~n_BEFORE_CALL_316 (* 2 |v_mult_#in~n_5784|))))) (< v_mult_~n_BEFORE_CALL_316 |v_mult_#in~n_BEFORE_CALL_234|) (exists ((|v_mult_#in~n_6159| Int) (|v_mult_#in~n_6156| Int) (|v_mult_#in~n_6157| Int) (|v_mult_#in~n_6151| Int) (aux_mod_v_mult_~n_BEFORE_CALL_316_166 Int) (aux_div_v_mult_~n_BEFORE_CALL_316_166 Int)) (and (<= |v_mult_#in~n_6157| |v_mult_#in~n_6151|) (<= |v_mult_#in~n_6156| |v_mult_#in~n_6159|) (< aux_mod_v_mult_~n_BEFORE_CALL_316_166 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_316_166) (forall ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (let ((.cse0 (* 3 |v_mult_#in~n_6156|)) (.cse1 (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166)) (.cse2 (* 3 |v_mult_#in~n_6157|)) (.cse3 (* 3 |v_mult_#in~n_6151|))) (or (< |v_mult_#in~n_5784| |v_mult_#in~n_5788|) (<= (+ 2147483647 (* 2 |v_mult_#in~n_5784|)) (+ v_mult_~n_BEFORE_CALL_317 (div (+ (* |v_mult_#in~n_6156| 15) (* aux_div_v_mult_~n_BEFORE_CALL_316_166 10) (* |v_mult_#in~n_6151| 15) (* v_mult_~n_BEFORE_CALL_317 5) (* |v_mult_#in~n_6157| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_316_166 5) (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (- 8589934588)) 2) aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse0 .cse1 .cse2 .cse3)) (< |v_mult_#in~n_5787| |v_mult_#in~n_5784|) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_317 aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse0 .cse1 |v_mult_#in~n_5787| .cse2 .cse3))))) (<= |v_mult_#in~n_6151| |v_mult_#in~n_6156|) (<= (+ v_mult_~n_BEFORE_CALL_317 aux_mod_v_mult_~n_BEFORE_CALL_316_166 |v_mult_#in~n_BEFORE_CALL_234| (* 3 |v_mult_#in~n_6156|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166) (* 3 |v_mult_#in~n_6157|) (* 3 |v_mult_#in~n_6151|)) 2147483647) (<= |v_mult_#in~n_6159| v_mult_~n_BEFORE_CALL_317) (< aux_div_v_mult_~n_BEFORE_CALL_316_166 (+ (* 2 |v_mult_#in~n_6159|) |v_mult_#in~n_6157|)))) (<= (+ v_mult_~n_BEFORE_CALL_317 v_mult_~n_BEFORE_CALL_316 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from false [2021-11-07 02:08:56,579 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_234| Int) (v_mult_~n_BEFORE_CALL_316 Int) (v_mult_~n_BEFORE_CALL_317 Int)) (or (< v_mult_~n_BEFORE_CALL_317 |c_mult_#in~n|) (exists ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (and (<= |v_mult_#in~n_5784| |v_mult_#in~n_5787|) (<= |v_mult_#in~n_5788| |v_mult_#in~n_5784|) (<= |v_mult_#in~n_5787| v_mult_~n_BEFORE_CALL_316) (< (div (+ 2147483647 (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (* v_mult_~n_BEFORE_CALL_316 (- 5))) 2) (+ v_mult_~n_BEFORE_CALL_316 (* 2 |v_mult_#in~n_5784|))))) (< v_mult_~n_BEFORE_CALL_316 |v_mult_#in~n_BEFORE_CALL_234|) (exists ((|v_mult_#in~n_6159| Int) (|v_mult_#in~n_6156| Int) (|v_mult_#in~n_6157| Int) (|v_mult_#in~n_6151| Int) (aux_mod_v_mult_~n_BEFORE_CALL_316_166 Int) (aux_div_v_mult_~n_BEFORE_CALL_316_166 Int)) (and (<= |v_mult_#in~n_6157| |v_mult_#in~n_6151|) (<= |v_mult_#in~n_6156| |v_mult_#in~n_6159|) (< aux_mod_v_mult_~n_BEFORE_CALL_316_166 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_316_166) (forall ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (let ((.cse0 (* 3 |v_mult_#in~n_6156|)) (.cse1 (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166)) (.cse2 (* 3 |v_mult_#in~n_6157|)) (.cse3 (* 3 |v_mult_#in~n_6151|))) (or (< |v_mult_#in~n_5784| |v_mult_#in~n_5788|) (<= (+ 2147483647 (* 2 |v_mult_#in~n_5784|)) (+ v_mult_~n_BEFORE_CALL_317 (div (+ (* |v_mult_#in~n_6156| 15) (* aux_div_v_mult_~n_BEFORE_CALL_316_166 10) (* |v_mult_#in~n_6151| 15) (* v_mult_~n_BEFORE_CALL_317 5) (* |v_mult_#in~n_6157| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_316_166 5) (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (- 8589934588)) 2) aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse0 .cse1 .cse2 .cse3)) (< |v_mult_#in~n_5787| |v_mult_#in~n_5784|) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_317 aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse0 .cse1 |v_mult_#in~n_5787| .cse2 .cse3))))) (<= |v_mult_#in~n_6151| |v_mult_#in~n_6156|) (<= (+ v_mult_~n_BEFORE_CALL_317 aux_mod_v_mult_~n_BEFORE_CALL_316_166 |v_mult_#in~n_BEFORE_CALL_234| (* 3 |v_mult_#in~n_6156|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166) (* 3 |v_mult_#in~n_6157|) (* 3 |v_mult_#in~n_6151|)) 2147483647) (<= |v_mult_#in~n_6159| v_mult_~n_BEFORE_CALL_317) (< aux_div_v_mult_~n_BEFORE_CALL_316_166 (+ (* 2 |v_mult_#in~n_6159|) |v_mult_#in~n_6157|)))) (<= (+ v_mult_~n_BEFORE_CALL_317 v_mult_~n_BEFORE_CALL_316 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from true [2021-11-07 02:10:53,566 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_234| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79 Int) (v_mult_~n_BEFORE_CALL_316 Int) (|v_mult_#in~n_6472| Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79 Int) (aux_mod_v_mult_~n_BEFORE_CALL_317_112 Int)) (or (exists ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (and (<= |v_mult_#in~n_5784| |v_mult_#in~n_5787|) (<= |v_mult_#in~n_5788| |v_mult_#in~n_5784|) (<= |v_mult_#in~n_5787| v_mult_~n_BEFORE_CALL_316) (< (div (+ 2147483647 (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (* v_mult_~n_BEFORE_CALL_316 (- 5))) 2) (+ v_mult_~n_BEFORE_CALL_316 (* 2 |v_mult_#in~n_5784|))))) (<= (* 2 c_mult_~n) aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_316 aux_mod_v_mult_~n_BEFORE_CALL_317_112 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79) (* 6 |v_mult_#in~n_6472|) |c_mult_#in~n| c_mult_~n)) (< aux_mod_v_mult_~n_BEFORE_CALL_317_112 0) (< v_mult_~n_BEFORE_CALL_316 |v_mult_#in~n_BEFORE_CALL_234|) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79 0) (< c_mult_~n |v_mult_#in~n_6472|) (<= 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79) (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_317_112) (exists ((|v_mult_#in~n_6159| Int) (|v_mult_#in~n_6156| Int) (|v_mult_#in~n_6157| Int) (|v_mult_#in~n_6151| Int) (aux_mod_v_mult_~n_BEFORE_CALL_316_166 Int) (aux_div_v_mult_~n_BEFORE_CALL_316_166 Int)) (let ((.cse0 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79)) (.cse1 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79)) (.cse2 (* 6 |v_mult_#in~n_6472|))) (and (<= |v_mult_#in~n_6157| |v_mult_#in~n_6151|) (<= |v_mult_#in~n_6156| |v_mult_#in~n_6159|) (< aux_mod_v_mult_~n_BEFORE_CALL_316_166 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_316_166) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_316_166 |v_mult_#in~n_BEFORE_CALL_234| (* 3 |v_mult_#in~n_6156|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166) (* 3 |v_mult_#in~n_6157|) (* 3 |v_mult_#in~n_6151|)) (+ v_mult_~n_BEFORE_CALL_316 aux_mod_v_mult_~n_BEFORE_CALL_317_112 .cse0 .cse1 .cse2 c_mult_~n)) (<= |v_mult_#in~n_6151| |v_mult_#in~n_6156|) (forall ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (let ((.cse3 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79)) (.cse4 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79)) (.cse5 (* 6 |v_mult_#in~n_6472|)) (.cse6 (* 3 |v_mult_#in~n_6156|)) (.cse7 (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166)) (.cse8 (* 3 |v_mult_#in~n_6157|)) (.cse9 (* 3 |v_mult_#in~n_6151|))) (or (< (+ v_mult_~n_BEFORE_CALL_316 aux_mod_v_mult_~n_BEFORE_CALL_317_112 .cse3 .cse4 .cse5 c_mult_~n) (+ aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse6 .cse7 |v_mult_#in~n_5787| .cse8 .cse9)) (< |v_mult_#in~n_5784| |v_mult_#in~n_5788|) (< |v_mult_#in~n_5787| |v_mult_#in~n_5784|) (<= (+ v_mult_~n_BEFORE_CALL_316 aux_mod_v_mult_~n_BEFORE_CALL_317_112 .cse3 .cse4 .cse5 c_mult_~n (* 2 |v_mult_#in~n_5784|)) (+ aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse6 (div (+ (* |v_mult_#in~n_6156| 15) (* aux_div_v_mult_~n_BEFORE_CALL_316_166 10) (* |v_mult_#in~n_6151| 15) 2147483647 (* |v_mult_#in~n_6157| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_316_166 5) (* aux_mod_v_mult_~n_BEFORE_CALL_317_112 (- 5)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79 (- 20)) (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (* c_mult_~n (- 5)) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79 (- 10)) (* |v_mult_#in~n_6472| (- 30)) (* v_mult_~n_BEFORE_CALL_316 (- 5))) 2) .cse7 .cse8 .cse9))))) (<= (+ v_mult_~n_BEFORE_CALL_316 aux_mod_v_mult_~n_BEFORE_CALL_317_112 .cse0 .cse1 .cse2 c_mult_~n |v_mult_#in~n_6159|) 2147483647) (< aux_div_v_mult_~n_BEFORE_CALL_316_166 (+ (* 2 |v_mult_#in~n_6159|) |v_mult_#in~n_6157|))))))) is different from false [2021-11-07 02:10:55,727 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_234| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79 Int) (v_mult_~n_BEFORE_CALL_316 Int) (|v_mult_#in~n_6472| Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79 Int) (aux_mod_v_mult_~n_BEFORE_CALL_317_112 Int)) (or (exists ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (and (<= |v_mult_#in~n_5784| |v_mult_#in~n_5787|) (<= |v_mult_#in~n_5788| |v_mult_#in~n_5784|) (<= |v_mult_#in~n_5787| v_mult_~n_BEFORE_CALL_316) (< (div (+ 2147483647 (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (* v_mult_~n_BEFORE_CALL_316 (- 5))) 2) (+ v_mult_~n_BEFORE_CALL_316 (* 2 |v_mult_#in~n_5784|))))) (<= (* 2 c_mult_~n) aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_316 aux_mod_v_mult_~n_BEFORE_CALL_317_112 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79) (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79) (* 6 |v_mult_#in~n_6472|) |c_mult_#in~n| c_mult_~n)) (< aux_mod_v_mult_~n_BEFORE_CALL_317_112 0) (< v_mult_~n_BEFORE_CALL_316 |v_mult_#in~n_BEFORE_CALL_234|) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79 0) (< c_mult_~n |v_mult_#in~n_6472|) (<= 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79) (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_317_112) (exists ((|v_mult_#in~n_6159| Int) (|v_mult_#in~n_6156| Int) (|v_mult_#in~n_6157| Int) (|v_mult_#in~n_6151| Int) (aux_mod_v_mult_~n_BEFORE_CALL_316_166 Int) (aux_div_v_mult_~n_BEFORE_CALL_316_166 Int)) (let ((.cse0 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79)) (.cse1 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79)) (.cse2 (* 6 |v_mult_#in~n_6472|))) (and (<= |v_mult_#in~n_6157| |v_mult_#in~n_6151|) (<= |v_mult_#in~n_6156| |v_mult_#in~n_6159|) (< aux_mod_v_mult_~n_BEFORE_CALL_316_166 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_316_166) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_316_166 |v_mult_#in~n_BEFORE_CALL_234| (* 3 |v_mult_#in~n_6156|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166) (* 3 |v_mult_#in~n_6157|) (* 3 |v_mult_#in~n_6151|)) (+ v_mult_~n_BEFORE_CALL_316 aux_mod_v_mult_~n_BEFORE_CALL_317_112 .cse0 .cse1 .cse2 c_mult_~n)) (<= |v_mult_#in~n_6151| |v_mult_#in~n_6156|) (forall ((|v_mult_#in~n_5787| Int) (|v_mult_#in~n_5788| Int) (|v_mult_#in~n_5784| Int)) (let ((.cse3 (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79)) (.cse4 (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79)) (.cse5 (* 6 |v_mult_#in~n_6472|)) (.cse6 (* 3 |v_mult_#in~n_6156|)) (.cse7 (* 2 aux_div_v_mult_~n_BEFORE_CALL_316_166)) (.cse8 (* 3 |v_mult_#in~n_6157|)) (.cse9 (* 3 |v_mult_#in~n_6151|))) (or (< (+ v_mult_~n_BEFORE_CALL_316 aux_mod_v_mult_~n_BEFORE_CALL_317_112 .cse3 .cse4 .cse5 c_mult_~n) (+ aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse6 .cse7 |v_mult_#in~n_5787| .cse8 .cse9)) (< |v_mult_#in~n_5784| |v_mult_#in~n_5788|) (< |v_mult_#in~n_5787| |v_mult_#in~n_5784|) (<= (+ v_mult_~n_BEFORE_CALL_316 aux_mod_v_mult_~n_BEFORE_CALL_317_112 .cse3 .cse4 .cse5 c_mult_~n (* 2 |v_mult_#in~n_5784|)) (+ aux_mod_v_mult_~n_BEFORE_CALL_316_166 .cse6 (div (+ (* |v_mult_#in~n_6156| 15) (* aux_div_v_mult_~n_BEFORE_CALL_316_166 10) (* |v_mult_#in~n_6151| 15) 2147483647 (* |v_mult_#in~n_6157| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_316_166 5) (* aux_mod_v_mult_~n_BEFORE_CALL_317_112 (- 5)) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_317_112_79 (- 20)) (* |v_mult_#in~n_5788| (- 3)) (* |v_mult_#in~n_5787| (- 3)) (* c_mult_~n (- 5)) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_317_112_79 (- 10)) (* |v_mult_#in~n_6472| (- 30)) (* v_mult_~n_BEFORE_CALL_316 (- 5))) 2) .cse7 .cse8 .cse9))))) (<= (+ v_mult_~n_BEFORE_CALL_316 aux_mod_v_mult_~n_BEFORE_CALL_317_112 .cse0 .cse1 .cse2 c_mult_~n |v_mult_#in~n_6159|) 2147483647) (< aux_div_v_mult_~n_BEFORE_CALL_316_166 (+ (* 2 |v_mult_#in~n_6159|) |v_mult_#in~n_6157|))))))) is different from true [2021-11-07 02:10:55,761 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|v_mult_#in~n_BEFORE_CALL_234|, v_mult_~n_BEFORE_CALL_316] [2021-11-07 02:10:55,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [966507045] [2021-11-07 02:10:55,763 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 02:10:55,763 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:10:55,764 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:609) 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-07 02:10:55,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:10:55,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2021-11-07 02:10:55,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249247005] [2021-11-07 02:10:55,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-07 02:10:55,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:10:55,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-07 02:10:55,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3565, Unknown=12, NotChecked=492, Total=4290 [2021-11-07 02:10:55,768 INFO L87 Difference]: Start difference. First operand 266 states and 291 transitions. Second operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 17 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-07 02:11:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:11:06,588 INFO L93 Difference]: Finished difference Result 419 states and 459 transitions. [2021-11-07 02:11:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-11-07 02:11:06,589 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 17 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) Word has length 193 [2021-11-07 02:11:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:11:06,592 INFO L225 Difference]: With dead ends: 419 [2021-11-07 02:11:06,592 INFO L226 Difference]: Without dead ends: 418 [2021-11-07 02:11:06,595 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 183 SyntacticMatches, 15 SemanticMatches, 136 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4062 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=862, Invalid=16964, Unknown=12, NotChecked=1068, Total=18906 [2021-11-07 02:11:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-11-07 02:11:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 271. [2021-11-07 02:11:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.0324074074074074) internal successors, (223), 215 states have internal predecessors, (223), 9 states have call successors, (9), 6 states have call predecessors, (9), 45 states have return successors, (65), 49 states have call predecessors, (65), 7 states have call successors, (65) [2021-11-07 02:11:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2021-11-07 02:11:06,614 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 193 [2021-11-07 02:11:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:11:06,615 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2021-11-07 02:11:06,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 39 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 17 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-07 02:11:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2021-11-07 02:11:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-11-07 02:11:06,618 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:11:06,618 INFO L513 BasicCegarLoop]: trace histogram [19, 19, 17, 17, 17, 17, 16, 15, 15, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:11:06,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-07 02:11:06,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:11:06,844 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:11:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:11:06,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1493101035, now seen corresponding path program 14 times [2021-11-07 02:11:06,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:11:06,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289689833] [2021-11-07 02:11:06,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:11:06,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:11:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:11:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 6 proven. 926 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2021-11-07 02:11:08,728 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:11:08,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289689833] [2021-11-07 02:11:08,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289689833] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:11:08,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387747914] [2021-11-07 02:11:08,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 02:11:08,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:11:08,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:11:08,729 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:11:08,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-07 02:11:11,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2021-11-07 02:11:11,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:11:11,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-07 02:11:11,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:11:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 215 proven. 711 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2021-11-07 02:11:15,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:11:36,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_mult_~n_BEFORE_CALL_335_88 Int) (|v_mult_#in~n_6977| Int) (aux_div_v_mult_~n_BEFORE_CALL_335_88 Int)) (or (exists ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (and (<= |v_mult_#in~n_6752| |v_mult_#in~n_6751|) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88) |v_mult_#in~n_6743|) 2147483647) (<= |v_mult_#in~n_6746| |v_mult_#in~n_6752|) (<= |v_mult_#in~n_6751| |v_mult_#in~n_6743|) (< (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_335_88) (* 6 |v_mult_#in~n_6977|)) (+ (* 4 |v_mult_#in~n_6743|) 2147483647 (* 3 |v_mult_#in~n_6751|) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|))))) (<= (+ (* 4 c_mult_~n) |v_mult_#in~n_6977|) aux_div_v_mult_~n_BEFORE_CALL_335_88) (< aux_mod_v_mult_~n_BEFORE_CALL_335_88 0) (< c_mult_~n |v_mult_#in~n_6977|) (< 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 (* 3 |v_mult_#in~n_6977|) |c_mult_#in~n| (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88))) (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_335_88))) is different from false [2021-11-07 02:11:46,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_335 Int) (v_mult_~n_BEFORE_CALL_336 Int) (|v_mult_#in~n_BEFORE_CALL_249| Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_336 v_mult_~n_BEFORE_CALL_335 |c_mult_#res|) 2147483647) (exists ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (and (<= |v_mult_#in~n_6743| v_mult_~n_BEFORE_CALL_335) (<= |v_mult_#in~n_6752| |v_mult_#in~n_6751|) (<= |v_mult_#in~n_6746| |v_mult_#in~n_6752|) (< 2147483647 (+ (* 4 |v_mult_#in~n_6743|) (* 3 |v_mult_#in~n_6751|) (* 2 v_mult_~n_BEFORE_CALL_335) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|))) (<= |v_mult_#in~n_6751| |v_mult_#in~n_6743|))) (< v_mult_~n_BEFORE_CALL_335 |v_mult_#in~n_BEFORE_CALL_249|) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_335_88 Int) (|v_mult_#in~n_6977| Int) (aux_div_v_mult_~n_BEFORE_CALL_335_88 Int)) (and (<= |v_mult_#in~n_6977| v_mult_~n_BEFORE_CALL_336) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 |v_mult_#in~n_BEFORE_CALL_249| (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88)) 2147483647) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (forall ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (or (< |v_mult_#in~n_6743| |v_mult_#in~n_6751|) (<= (+ (* 4 |v_mult_#in~n_6743|) 2147483647 (* 3 |v_mult_#in~n_6751|) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|)) (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_335_88) (* 6 |v_mult_#in~n_6977|))) (< |v_mult_#in~n_6752| |v_mult_#in~n_6746|) (< 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88) |v_mult_#in~n_6743|)) (< |v_mult_#in~n_6751| |v_mult_#in~n_6752|))) (< aux_mod_v_mult_~n_BEFORE_CALL_335_88 2) (< aux_div_v_mult_~n_BEFORE_CALL_335_88 (+ (* 4 v_mult_~n_BEFORE_CALL_336) |v_mult_#in~n_6977|)))) (< v_mult_~n_BEFORE_CALL_336 |c_mult_#in~n|))) is different from false [2021-11-07 02:12:04,775 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_335 Int) (v_mult_~n_BEFORE_CALL_336 Int) (|v_mult_#in~n_BEFORE_CALL_249| Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_336 v_mult_~n_BEFORE_CALL_335 |c_mult_#t~ret8| c_mult_~n) 2147483647) (exists ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (and (<= |v_mult_#in~n_6743| v_mult_~n_BEFORE_CALL_335) (<= |v_mult_#in~n_6752| |v_mult_#in~n_6751|) (<= |v_mult_#in~n_6746| |v_mult_#in~n_6752|) (< 2147483647 (+ (* 4 |v_mult_#in~n_6743|) (* 3 |v_mult_#in~n_6751|) (* 2 v_mult_~n_BEFORE_CALL_335) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|))) (<= |v_mult_#in~n_6751| |v_mult_#in~n_6743|))) (< v_mult_~n_BEFORE_CALL_335 |v_mult_#in~n_BEFORE_CALL_249|) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_335_88 Int) (|v_mult_#in~n_6977| Int) (aux_div_v_mult_~n_BEFORE_CALL_335_88 Int)) (and (<= |v_mult_#in~n_6977| v_mult_~n_BEFORE_CALL_336) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 |v_mult_#in~n_BEFORE_CALL_249| (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88)) 2147483647) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (forall ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (or (< |v_mult_#in~n_6743| |v_mult_#in~n_6751|) (<= (+ (* 4 |v_mult_#in~n_6743|) 2147483647 (* 3 |v_mult_#in~n_6751|) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|)) (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_335_88) (* 6 |v_mult_#in~n_6977|))) (< |v_mult_#in~n_6752| |v_mult_#in~n_6746|) (< 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88) |v_mult_#in~n_6743|)) (< |v_mult_#in~n_6751| |v_mult_#in~n_6752|))) (< aux_mod_v_mult_~n_BEFORE_CALL_335_88 2) (< aux_div_v_mult_~n_BEFORE_CALL_335_88 (+ (* 4 v_mult_~n_BEFORE_CALL_336) |v_mult_#in~n_6977|)))) (< v_mult_~n_BEFORE_CALL_336 |c_mult_#in~n|))) is different from false [2021-11-07 02:12:06,782 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_335 Int) (v_mult_~n_BEFORE_CALL_336 Int) (|v_mult_#in~n_BEFORE_CALL_249| Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_336 v_mult_~n_BEFORE_CALL_335 |c_mult_#t~ret8| c_mult_~n) 2147483647) (exists ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (and (<= |v_mult_#in~n_6743| v_mult_~n_BEFORE_CALL_335) (<= |v_mult_#in~n_6752| |v_mult_#in~n_6751|) (<= |v_mult_#in~n_6746| |v_mult_#in~n_6752|) (< 2147483647 (+ (* 4 |v_mult_#in~n_6743|) (* 3 |v_mult_#in~n_6751|) (* 2 v_mult_~n_BEFORE_CALL_335) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|))) (<= |v_mult_#in~n_6751| |v_mult_#in~n_6743|))) (< v_mult_~n_BEFORE_CALL_335 |v_mult_#in~n_BEFORE_CALL_249|) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_335_88 Int) (|v_mult_#in~n_6977| Int) (aux_div_v_mult_~n_BEFORE_CALL_335_88 Int)) (and (<= |v_mult_#in~n_6977| v_mult_~n_BEFORE_CALL_336) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 |v_mult_#in~n_BEFORE_CALL_249| (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88)) 2147483647) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (forall ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (or (< |v_mult_#in~n_6743| |v_mult_#in~n_6751|) (<= (+ (* 4 |v_mult_#in~n_6743|) 2147483647 (* 3 |v_mult_#in~n_6751|) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|)) (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_335_88) (* 6 |v_mult_#in~n_6977|))) (< |v_mult_#in~n_6752| |v_mult_#in~n_6746|) (< 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88) |v_mult_#in~n_6743|)) (< |v_mult_#in~n_6751| |v_mult_#in~n_6752|))) (< aux_mod_v_mult_~n_BEFORE_CALL_335_88 2) (< aux_div_v_mult_~n_BEFORE_CALL_335_88 (+ (* 4 v_mult_~n_BEFORE_CALL_336) |v_mult_#in~n_6977|)))) (< v_mult_~n_BEFORE_CALL_336 |c_mult_#in~n|))) is different from true [2021-11-07 02:12:49,998 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_336 Int) (aux_mod_v_mult_~n_BEFORE_CALL_335_142 Int) (aux_div_v_mult_~n_BEFORE_CALL_335_142 Int) (|v_mult_#in~n_7184| Int) (|v_mult_#in~n_BEFORE_CALL_249| Int)) (let ((.cse0 (* 2 c_mult_~n))) (or (< c_mult_~n |v_mult_#in~n_7184|) (exists ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (and (<= |v_mult_#in~n_6752| |v_mult_#in~n_6751|) (<= (+ v_mult_~n_BEFORE_CALL_336 aux_mod_v_mult_~n_BEFORE_CALL_335_142 (* 3 aux_div_v_mult_~n_BEFORE_CALL_335_142) (* 4 |v_mult_#in~n_7184|) (* 2 c_mult_~n) |v_mult_#in~n_6743|) 2147483647) (< (+ (* 4 c_mult_~n) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_335_142) (* 2 v_mult_~n_BEFORE_CALL_336) (* 6 aux_div_v_mult_~n_BEFORE_CALL_335_142) (* 8 |v_mult_#in~n_7184|)) (+ (* 4 |v_mult_#in~n_6743|) 2147483647 (* 3 |v_mult_#in~n_6751|) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|))) (<= |v_mult_#in~n_6746| |v_mult_#in~n_6752|) (<= |v_mult_#in~n_6751| |v_mult_#in~n_6743|))) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_336 |v_mult_#in~n_BEFORE_CALL_249| aux_mod_v_mult_~n_BEFORE_CALL_335_142 (* 3 aux_div_v_mult_~n_BEFORE_CALL_335_142) (* 4 |v_mult_#in~n_7184|) .cse0)) (< aux_mod_v_mult_~n_BEFORE_CALL_335_142 0) (<= 3 aux_mod_v_mult_~n_BEFORE_CALL_335_142) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_335_88 Int) (|v_mult_#in~n_6977| Int) (aux_div_v_mult_~n_BEFORE_CALL_335_88 Int)) (and (<= |v_mult_#in~n_6977| v_mult_~n_BEFORE_CALL_336) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 |v_mult_#in~n_BEFORE_CALL_249| (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88)) 2147483647) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (forall ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (or (< |v_mult_#in~n_6743| |v_mult_#in~n_6751|) (<= (+ (* 4 |v_mult_#in~n_6743|) 2147483647 (* 3 |v_mult_#in~n_6751|) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|)) (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_335_88) (* 6 |v_mult_#in~n_6977|))) (< |v_mult_#in~n_6752| |v_mult_#in~n_6746|) (< 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88) |v_mult_#in~n_6743|)) (< |v_mult_#in~n_6751| |v_mult_#in~n_6752|))) (< aux_mod_v_mult_~n_BEFORE_CALL_335_88 2) (< aux_div_v_mult_~n_BEFORE_CALL_335_88 (+ (* 4 v_mult_~n_BEFORE_CALL_336) |v_mult_#in~n_6977|)))) (<= .cse0 aux_div_v_mult_~n_BEFORE_CALL_335_142) (< v_mult_~n_BEFORE_CALL_336 |c_mult_#in~n|)))) is different from false [2021-11-07 02:12:52,102 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_336 Int) (aux_mod_v_mult_~n_BEFORE_CALL_335_142 Int) (aux_div_v_mult_~n_BEFORE_CALL_335_142 Int) (|v_mult_#in~n_7184| Int) (|v_mult_#in~n_BEFORE_CALL_249| Int)) (let ((.cse0 (* 2 c_mult_~n))) (or (< c_mult_~n |v_mult_#in~n_7184|) (exists ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (and (<= |v_mult_#in~n_6752| |v_mult_#in~n_6751|) (<= (+ v_mult_~n_BEFORE_CALL_336 aux_mod_v_mult_~n_BEFORE_CALL_335_142 (* 3 aux_div_v_mult_~n_BEFORE_CALL_335_142) (* 4 |v_mult_#in~n_7184|) (* 2 c_mult_~n) |v_mult_#in~n_6743|) 2147483647) (< (+ (* 4 c_mult_~n) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_335_142) (* 2 v_mult_~n_BEFORE_CALL_336) (* 6 aux_div_v_mult_~n_BEFORE_CALL_335_142) (* 8 |v_mult_#in~n_7184|)) (+ (* 4 |v_mult_#in~n_6743|) 2147483647 (* 3 |v_mult_#in~n_6751|) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|))) (<= |v_mult_#in~n_6746| |v_mult_#in~n_6752|) (<= |v_mult_#in~n_6751| |v_mult_#in~n_6743|))) (< 2147483647 (+ v_mult_~n_BEFORE_CALL_336 |v_mult_#in~n_BEFORE_CALL_249| aux_mod_v_mult_~n_BEFORE_CALL_335_142 (* 3 aux_div_v_mult_~n_BEFORE_CALL_335_142) (* 4 |v_mult_#in~n_7184|) .cse0)) (< aux_mod_v_mult_~n_BEFORE_CALL_335_142 0) (<= 3 aux_mod_v_mult_~n_BEFORE_CALL_335_142) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_335_88 Int) (|v_mult_#in~n_6977| Int) (aux_div_v_mult_~n_BEFORE_CALL_335_88 Int)) (and (<= |v_mult_#in~n_6977| v_mult_~n_BEFORE_CALL_336) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 |v_mult_#in~n_BEFORE_CALL_249| (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88)) 2147483647) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (forall ((|v_mult_#in~n_6743| Int) (|v_mult_#in~n_6751| Int) (|v_mult_#in~n_6752| Int) (|v_mult_#in~n_6746| Int)) (or (< |v_mult_#in~n_6743| |v_mult_#in~n_6751|) (<= (+ (* 4 |v_mult_#in~n_6743|) 2147483647 (* 3 |v_mult_#in~n_6751|) (* 3 |v_mult_#in~n_6746|) (* 2 |v_mult_#in~n_6752|)) (+ (* 2 aux_mod_v_mult_~n_BEFORE_CALL_335_88) (* 4 aux_div_v_mult_~n_BEFORE_CALL_335_88) (* 6 |v_mult_#in~n_6977|))) (< |v_mult_#in~n_6752| |v_mult_#in~n_6746|) (< 2147483647 (+ aux_mod_v_mult_~n_BEFORE_CALL_335_88 (* 3 |v_mult_#in~n_6977|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_335_88) |v_mult_#in~n_6743|)) (< |v_mult_#in~n_6751| |v_mult_#in~n_6752|))) (< aux_mod_v_mult_~n_BEFORE_CALL_335_88 2) (< aux_div_v_mult_~n_BEFORE_CALL_335_88 (+ (* 4 v_mult_~n_BEFORE_CALL_336) |v_mult_#in~n_6977|)))) (<= .cse0 aux_div_v_mult_~n_BEFORE_CALL_335_142) (< v_mult_~n_BEFORE_CALL_336 |c_mult_#in~n|)))) is different from true [2021-11-07 02:12:52,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_336, |v_mult_#in~n_BEFORE_CALL_249|] [2021-11-07 02:12:52,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1397070868] [2021-11-07 02:12:52,127 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:12:52,127 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:12:52,128 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:609) 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-07 02:12:52,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:12:52,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2021-11-07 02:12:52,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961562570] [2021-11-07 02:12:52,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-07 02:12:52,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:12:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-07 02:12:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3228, Unknown=6, NotChecked=468, Total=3906 [2021-11-07 02:12:52,131 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand has 37 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 36 states have internal predecessors, (83), 5 states have call successors, (6), 2 states have call predecessors, (6), 16 states have return successors, (16), 16 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-07 02:13:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:13:03,551 INFO L93 Difference]: Finished difference Result 456 states and 490 transitions. [2021-11-07 02:13:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-07 02:13:03,552 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 36 states have internal predecessors, (83), 5 states have call successors, (6), 2 states have call predecessors, (6), 16 states have return successors, (16), 16 states have call predecessors, (16), 4 states have call successors, (16) Word has length 190 [2021-11-07 02:13:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:13:03,557 INFO L225 Difference]: With dead ends: 456 [2021-11-07 02:13:03,557 INFO L226 Difference]: Without dead ends: 453 [2021-11-07 02:13:03,560 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 186 SyntacticMatches, 12 SemanticMatches, 120 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2810 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=873, Invalid=12943, Unknown=6, NotChecked=940, Total=14762 [2021-11-07 02:13:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-11-07 02:13:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 364. [2021-11-07 02:13:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 290 states have (on average 1.0310344827586206) internal successors, (299), 289 states have internal predecessors, (299), 12 states have call successors, (12), 8 states have call predecessors, (12), 61 states have return successors, (82), 66 states have call predecessors, (82), 9 states have call successors, (82) [2021-11-07 02:13:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 393 transitions. [2021-11-07 02:13:03,586 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 393 transitions. Word has length 190 [2021-11-07 02:13:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:13:03,587 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 393 transitions. [2021-11-07 02:13:03,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 36 states have internal predecessors, (83), 5 states have call successors, (6), 2 states have call predecessors, (6), 16 states have return successors, (16), 16 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-07 02:13:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 393 transitions. [2021-11-07 02:13:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-07 02:13:03,591 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:13:03,591 INFO L513 BasicCegarLoop]: trace histogram [16, 16, 15, 14, 14, 14, 14, 14, 14, 13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:13:03,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-07 02:13:03,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:13:03,807 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:13:03,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:13:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash 195640405, now seen corresponding path program 15 times [2021-11-07 02:13:03,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:13:03,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448960862] [2021-11-07 02:13:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:13:03,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:13:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:13:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 375 proven. 348 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-11-07 02:13:05,106 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:13:05,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448960862] [2021-11-07 02:13:05,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448960862] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:13:05,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973180114] [2021-11-07 02:13:05,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 02:13:05,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:13:05,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:13:05,109 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:13:05,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-07 02:13:08,925 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 02:13:08,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 02:13:08,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-07 02:13:08,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:13:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 4 proven. 748 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-11-07 02:13:12,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:13:22,819 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_349] [2021-11-07 02:13:22,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1464301561] [2021-11-07 02:13:22,821 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-07 02:13:22,821 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 02:13:22,822 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:609) 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-07 02:13:22,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:13:22,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2021-11-07 02:13:22,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620488334] [2021-11-07 02:13:22,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-07 02:13:22,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:13:22,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-07 02:13:22,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2564, Unknown=0, NotChecked=0, Total=2756 [2021-11-07 02:13:22,826 INFO L87 Difference]: Start difference. First operand 364 states and 393 transitions. Second operand has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 4 states have call successors, (5), 2 states have call predecessors, (5), 12 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2021-11-07 02:13:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:13:29,165 INFO L93 Difference]: Finished difference Result 414 states and 443 transitions. [2021-11-07 02:13:29,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-07 02:13:29,166 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 4 states have call successors, (5), 2 states have call predecessors, (5), 12 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) Word has length 167 [2021-11-07 02:13:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:13:29,168 INFO L225 Difference]: With dead ends: 414 [2021-11-07 02:13:29,168 INFO L226 Difference]: Without dead ends: 411 [2021-11-07 02:13:29,170 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 152 SyntacticMatches, 9 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=602, Invalid=8518, Unknown=0, NotChecked=0, Total=9120 [2021-11-07 02:13:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-11-07 02:13:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 369. [2021-11-07 02:13:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 294 states have (on average 1.030612244897959) internal successors, (303), 293 states have internal predecessors, (303), 12 states have call successors, (12), 8 states have call predecessors, (12), 62 states have return successors, (83), 67 states have call predecessors, (83), 9 states have call successors, (83) [2021-11-07 02:13:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 398 transitions. [2021-11-07 02:13:29,191 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 398 transitions. Word has length 167 [2021-11-07 02:13:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:13:29,192 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 398 transitions. [2021-11-07 02:13:29,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 4 states have call successors, (5), 2 states have call predecessors, (5), 12 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2021-11-07 02:13:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 398 transitions. [2021-11-07 02:13:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-11-07 02:13:29,196 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:13:29,196 INFO L513 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1] [2021-11-07 02:13:29,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-07 02:13:29,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-07 02:13:29,412 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2021-11-07 02:13:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:13:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash 257243998, now seen corresponding path program 13 times [2021-11-07 02:13:29,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:13:29,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791942743] [2021-11-07 02:13:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:13:29,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:13:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:13:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 0 proven. 887 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2021-11-07 02:13:32,248 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:13:32,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791942743] [2021-11-07 02:13:32,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791942743] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:13:32,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050440759] [2021-11-07 02:13:32,249 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 02:13:32,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:13:32,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:13:32,255 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:13:32,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1042bb91-2ee3-4df8-9021-b88930c8260a/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process